Benjamin Doerr. Balanced Coloring: Equally Easy for All Numbers of Colors?. In Helmut Alt, Afonso Ferreira, editors, STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings. Volume 2285 of Lecture Notes in Computer Science, pages 112-120, Springer, 2002. [doi]
@inproceedings{Doerr02:2,
title = {Balanced Coloring: Equally Easy for All Numbers of Colors?},
author = {Benjamin Doerr},
year = {2002},
url = {http://link.springer.de/link/service/series/0558/bibs/2285/22850112.htm},
researchr = {https://researchr.org/publication/Doerr02%3A2},
cites = {0},
citedby = {0},
pages = {112-120},
booktitle = {STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
editor = {Helmut Alt and Afonso Ferreira},
volume = {2285},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-43283-3},
}