Author:
Bodlaender Hans L.,Kolay Sudeshna,Pieterse Astrid
Publisher
Springer International Publishing
Reference14 articles.
1. Ajwani, D., Elbassioni, K., Govindarajan, S., Ray, S.: Conflict-free coloringfor rectangle ranges using
$$O(n^{.382})$$
O
(
n
.
382
)
colors. Discrete Comput. Geom. 48(1), 39–52 (2012).
https://doi.org/10.1007/s00454-012-9425-5
2. Bodlaender, H.L., Kolay, S., Pieterse, A.: Parameterized complexity of conflict-free graph coloring. CoRR abs/1905.00305 (2019).
https://arxiv.org/abs/1905.00305
3. Cheilaris, P.: Conflict-free coloring. Ph.D. thesis, City University of New York (2009)
4. Cygan, M., et al.: Parameterized Algorithms. Springer, Heidelberg (2015).
https://doi.org/10.1007/978-3-319-21275-3
5. Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. In: Proceedings of the 43rd FOCS, pp. 691–700 (2002).
https://doi.org/10.1109/SFCS.2002.1181994
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献