@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.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}
}