Author of the publication

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.

, , and . Int. J. Comput. Geom. Appl., 3 (1): 85-105 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Some City Guarding Problems., , , , and . COCOON, volume 5092 of Lecture Notes in Computer Science, page 600-610. Springer, (2008)Guarding a terrain by two watchtowers., , , , , and . SCG, page 346-355. ACM, (2005)On Random and Partition Testing.. ISSTA, page 42-48. ACM, (1998)Parallel Tree Techniques and Code Optimization., , and . Aegean Workshop on Computing, volume 227 of Lecture Notes in Computer Science, page 205-216. Springer, (1986)An Experimental Study of Weighted k-Link Shortest Path Algorithms., , , , and . WAFR, volume 47 of Springer Tracts in Advanced Robotics, page 187-202. Springer, (2006)On Structured Digraphs and Program Testing., and . IEEE Trans. Computers, 30 (1): 67-77 (1981)Watchman routes in the presence of a pair of convex polygons., and . CCCG, page 127-132. Carleton University, Ottawa, Canada, (1995)Optimum Watchman Routes., and . SCG, page 24-33. ACM, (1986)Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks., , , , and . IPPS/SPDP Workshops, volume 1388 of Lecture Notes in Computer Science, page 770-789. Springer, (1998)On some reliability estimation problems in random and partition testing., , and . ISSRE, page 194-201. IEEE Computer Society, (1991)