Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. D. Ajwani, K. Elbassioni, S. Govindarajan, S. Ray, Conflict-free coloring for rectangle ranges using n.382 colors, in: Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA 07), 2007, pp. 181–187
2. Coloring geometric range spaces;Aloupis,2008
3. Research Problems in Discrete Geometry;Brass,2005
4. Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles;Chen;Random Structures Algorithms,2009
5. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks;Even;SIAM J. Comput.,2003
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献