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

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]

Abstract

Abstract is missing.