Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference13 articles.
1. D. Ajwani, K. Elbassioni, S. Govindarajan, S. Ray, Conflict-free coloring for rectangle ranges using O˜(n.382+ϵ) colors, in: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 2007, pp. 181–187.
2. G. Brodal, R. Jacob, Dynamic planar convex hull, in: Proc. 43rd IEEE Symp. on Foundations of Computer Science, 2002, pp. 617–626.
3. X. Chen, J. Pach, M. Szegedy, G. Tardos, Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles, in: SODAʼ08: Proceedings of the Nineteenth Annual ACM–SIAM Symposium on Discrete Algorithms, 2008, pp. 94–101.
4. Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks;Even;SIAM J. Comput.,2003
5. R. Fulek, Coloring geometric hypergraph defined by an arrangement of half-planes, in: Proceedings of the 22th Canadian Conference on Computational Geometry, 2010, pp. 71–74.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献