1. Cheilaris P (2009) Conflict-free coloring. Dissertation, City University of New York, p 5
2. Gargano L, Rescigno AA (2015) Complexity of conflict-free colorings of graphs. Theoret Comput Sci 566:39–49
3. Bar-Noy A, Cheilaris P, Smorodinsky S (2008) Deterministic conflict-free coloring for intervals: from offline to online. ACM Trans Algorithms (TALG) 4(4):44
4. Ajwani D, Elbassion K, Govindarajan S, Ray S (2007) Conflict-free coloring for rectangle ranges using O(n0.382) colors. In: Proceedings of the nineteenth annual ACM symposium on parallel algorithms and architectures. ACM, pp 181–187
5. Lev-Tov N, Peleg D (2009) Conflict-free coloring of unit disks. Discrete Appl Math 157(7):1521–1532