@inproceedings{e9f4d4adeabc4429b1a52acf42d8b67d,
title = "Non-monochromatic and conflict-free coloring on tree spaces and planar network spaces",
abstract = "It is well known that any set of n intervals in (Formula Presented) admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.",
author = "Boris Aronov and {de Berg}, Mark and Aleksandar Markovic and Gerhard Woeginger",
note = "Publisher Copyright: {\textcopyright} 2018, Springer International Publishing AG, part of Springer Nature.; 24th International Conference on Computing and Combinatorics Conference, COCOON 2018 ; Conference date: 02-07-2018 Through 04-07-2018",
year = "2018",
doi = "10.1007/978-3-319-94776-1_47",
language = "English (US)",
isbn = "9783319947754",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "567--578",
editor = "Daming Zhu and Lusheng Wang",
booktitle = "Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings",
}