Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs

Stefan Dobrev, Rastislav Královic, Richard Královic. Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput. Syst., 56(1):197-219, 2015. [doi]

@article{DobrevKK15,
  title = {Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs},
  author = {Stefan Dobrev and Rastislav Královic and Richard Královic},
  year = {2015},
  doi = {10.1007/s00224-014-9592-2},
  url = {http://dx.doi.org/10.1007/s00224-014-9592-2},
  researchr = {https://researchr.org/publication/DobrevKK15},
  cites = {0},
  citedby = {0},
  journal = {Theory Comput. Syst.},
  volume = {56},
  number = {1},
  pages = {197-219},
}