Keller, Chaya; Smorodinsky, Shakhar Conflict-free coloring of intersection graphs of geometric objects. (English) Zbl 1403.68165 Czumaj, Artur (ed.), Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7–10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-503-1/ebook). 2397-2411 (2018). Cited in 7 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C15 Coloring of graphs and hypergraphs 05C62 Graph representations (geometric and intersection representations, etc.) 68U05 Computer graphics; computational geometry (digital and algorithmic aspects) Citations:Zbl 1069.68120 PDFBibTeX XMLCite \textit{C. Keller} and \textit{S. Smorodinsky}, in: Proceedings of the 29th annual ACM-SIAM symposium on discrete algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2397--2411 (2018; Zbl 1403.68165) Full Text: arXiv Link