BibTeX Export for Independent Sets near the Lower Bound in Bounded Degree Graphs

Copy to Clipboard Download

@InProceedings{dvorak_et_al:LIPIcs.STACS.2017.28,
  author =	{Dvor\'{a}k, Zdenek and Lidick\'{y}, Bernard},
  title =	{{Independent Sets near the Lower Bound in Bounded Degree Graphs}},
  booktitle =	{34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
  pages =	{28:1--28:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-028-6},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{66},
  editor =	{Vollmer, Heribert and Vall\'{e}e, Brigitte},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.28},
  URN =		{urn:nbn:de:0030-drops-70042},
  doi =		{10.4230/LIPIcs.STACS.2017.28},
  annote =	{Keywords: independent set, bounded degree, Delta-colorable, fixed parameter tractability}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode