The potential to improve the choice: list conflict-free coloring for geometric hypergraphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Panagiotis Cheilaris, Shakhar Smorodinsky, Marek Sulovský. The potential to improve the choice: list conflict-free coloring for geometric hypergraphs. In Ferran Hurtado, Marc J. van Kreveld, editors, Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011. pages 424-432, ACM, 2011. [doi]

This author has not been identified. Look up 'Panagiotis Cheilaris' in GoogleThis author has not been identified. Look up 'Shakhar Smorodinsky' in GoogleThis author has not been identified. Look up 'Marek Sulovský' in Google

runs on WebDSL