Nicolas Bousquet, Aurélie Lagoutte, Stéphan Thomassé. Graph coloring, communication complexity and the stubborn problem (Invited talk). In Natacha Portier, Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. Volume 20 of LIPIcs, pages 3-4, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. [doi]
@inproceedings{BousquetLS13,
title = {Graph coloring, communication complexity and the stubborn problem (Invited talk)},
author = {Nicolas Bousquet and Aurélie Lagoutte and Stéphan Thomassé},
year = {2013},
doi = {10.4230/LIPIcs.STACS.2013.3},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2013.3},
researchr = {https://researchr.org/publication/BousquetLS13},
cites = {0},
citedby = {0},
pages = {3-4},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany},
editor = {Natacha Portier and Thomas Wilke},
volume = {20},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-50-7},
}