1. Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-Free Coloring for Rectangle Ranges Using
$\tilde{O}(n^{.382+\epsilon})$
Colors. In: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 181–187 (2007)
2. Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Deterministic conflict-free coloring for intervals: From offline to online. ACM Transactions on Algorithms 4(4) (2008)
3. Cardinal, J., Cohen, N., Collette, S., Hoffmann, M., Rote, G: Coloring Dynamic Point Sets on a Line. In: EuroCG (2012)
4. Chen, X., Pach, J., Szegedy, M., Tardos, G.: Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 94–101 (2008)
5. Chen, K., Fiat, A., Levy, M., Matoušek, J., Mossel, E., Pach, J., Sharir, M., Smorodinsky, S., Wagner, U., Welzl, E.: Online conflict-free coloring for intervals, Siam. J. Comput. 36, 545–554 (2006)