BibTeX Export for On the Fine-Grained Complexity of Rainbow Coloring

Copy to Clipboard Download

@InProceedings{kowalik_et_al:LIPIcs.ESA.2016.58,
  author =	{Kowalik, Lukasz and Lauri, Juho and Socala, Arkadiusz},
  title =	{{On the Fine-Grained Complexity of Rainbow Coloring}},
  booktitle =	{24th Annual European Symposium on Algorithms (ESA 2016)},
  pages =	{58:1--58:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-015-6},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{57},
  editor =	{Sankowski, Piotr and Zaroliagis, Christos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.58},
  URN =		{urn:nbn:de:0030-drops-64001},
  doi =		{10.4230/LIPIcs.ESA.2016.58},
  annote =	{Keywords: graph coloring, computational complexity, lower bounds, exponential time hypothesis, FPT algorithms}
}

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