Online vertex colorings of random graphs without monochromatic subgraphs

Martin Marciniszyn, Reto Spöhel. Online vertex colorings of random graphs without monochromatic subgraphs. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 486-493, SIAM, 2007. [doi]

Authors

Martin Marciniszyn

This author has not been identified. Look up 'Martin Marciniszyn' in Google

Reto Spöhel

This author has not been identified. Look up 'Reto Spöhel' in Google