Graph coloring, communication complexity and the stubborn problem (Invited talk)

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]

Authors

Nicolas Bousquet

This author has not been identified. Look up 'Nicolas Bousquet' in Google

Aurélie Lagoutte

This author has not been identified. Look up 'Aurélie Lagoutte' in Google

Stéphan Thomassé

This author has not been identified. Look up 'Stéphan Thomassé' in Google