Approximating independent sets in sparse graphs

Nikhil Bansal. Approximating independent sets in sparse graphs. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 1-8, SIAM, 2015. [doi]

@inproceedings{Bansal15,
  title = {Approximating independent sets in sparse graphs},
  author = {Nikhil Bansal},
  year = {2015},
  doi = {10.1137/1.9781611973730.1},
  url = {http://dx.doi.org/10.1137/1.9781611973730.1},
  researchr = {https://researchr.org/publication/Bansal15},
  cites = {0},
  citedby = {0},
  pages = {1-8},
  booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
  editor = {Piotr Indyk},
  publisher = {SIAM},
  isbn = {978-1-61197-373-0},
}