Independent Sets near the Lower Bound in Bounded Degree Graphs

Zdenek Dvorák, Bernard Lidický. Independent Sets near the Lower Bound in Bounded Degree Graphs. In Heribert Vollmer, Brigitte Vallée, editors, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. Volume 66 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{DvorakL17,
  title = {Independent Sets near the Lower Bound in Bounded Degree Graphs},
  author = {Zdenek Dvorák and Bernard Lidický},
  year = {2017},
  doi = {10.4230/LIPIcs.STACS.2017.28},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2017.28},
  researchr = {https://researchr.org/publication/DvorakL17},
  cites = {0},
  citedby = {0},
  booktitle = {34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany},
  editor = {Heribert Vollmer and Brigitte Vallée},
  volume = {66},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-028-6},
}