Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Georgia, K., Aris, P., Katerina, P.: Conflict-free Coloring for Connected Subgraphs of Trees and Trees of Rings. In: Proc. 11th Panhellenic Conference in Informatics (2007)
2. Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM Journal on Computing 33, 94–136; Also in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2002)
3. Bar-Noy, A., Cheilaris, P., Lampis, M., Zachos, S.: Conflict-free coloring graphs and other related problems (2006) (manuscript)
4. Cheilaris, P., Specker, E., Zachos, S.: Neochromatica (2006) (manuscript)
5. Bar-Noy, A., Cheilaris, P., Smorodinsky, S.: Conflict-free coloring for intervals: from offline to online. In: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2006), Cambridge, Massachusetts, USA, July 30-August 2, pp. 128–137 (2006)