Decomposition of Multiple Coverings into More Parts-Reference-Cited by-同舟云学术

Decomposition of Multiple Coverings into More Parts

Published:2010-01-08 Issue:3 Volume:44 Page:706-723
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Aloupis Greg,Cardinal Jean,Collette Sébastien,Langerman Stefan,Orden David,Ramos Pedro

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-009-9238-3.pdf

Reference16 articles.

1. Ali Abam, M., de Berg, M., Poon, S.: Fault-tolerant conflict-free coloring. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG’08) (2008)

2. Abellanas, M., Bose, P., Garcia, J., Hurtado, F., Nicolas, C., Ramos, P.: On properties of higher order Delaunay graphs with applications. Int. J. Comput. Geom. Appl. (to appear)

3. Lecture Notes in Computer Science;G. Aloupis,2008

4. Brass, P., Moser, W.O.J., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)

5. Buchsbaum, A., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA’07), pp. 1056–1063 (2007)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Coloring Points with Respect to Squares;Discrete & Computational Geometry;2017-06-19

2. Unsplittable coverings in the plane;Advances in Mathematics;2016-10

3. Set It and Forget It: Approximating the Set Once Strip Cover Problem;Algorithmica;2016-08-15

4. Changing of the guards: Strip cover with duty cycling;Theoretical Computer Science;2016-01

5. Unsplittable Coverings in the Plane;Graph-Theoretic Concepts in Computer Science;2016