Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna. Tight Lower Bounds for the Complexity of Multicoloring. In Kirk Pruhs, Christian Sohler, editors, 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. Volume 87 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{BonamyKPSW17,
title = {Tight Lower Bounds for the Complexity of Multicoloring},
author = {Marthe Bonamy and Lukasz Kowalik and Michal Pilipczuk and Arkadiusz Socala and Marcin Wrochna},
year = {2017},
doi = {10.4230/LIPIcs.ESA.2017.18},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.18},
researchr = {https://researchr.org/publication/BonamyKPSW17},
cites = {0},
citedby = {0},
booktitle = {25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria},
editor = {Kirk Pruhs and Christian Sohler},
volume = {87},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-049-1},
}