Tight Lower Bounds for the Complexity of Multicoloring

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.