Author of the publication

Polynomial-Time Algorithms for the Touring Rays and Related Problems.

. AAIM, volume 12290 of Lecture Notes in Computer Science, page 1-12. Springer, (2020)

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

New Algorithms for Barrier Coverage with Mobile Sensors., and . FAW, volume 6213 of Lecture Notes in Computer Science, page 327-338. Springer, (2010)A Characterization of Link-2 LR-visibility Polygons with Applications., , and . JCDCGG, volume 8845 of Lecture Notes in Computer Science, page 161-172. Springer, (2013)Finding shortest safari routes in simple polygons., and . Inf. Process. Lett., 87 (4): 179-186 (2003)Polynomial-Time Algorithms for the Touring Rays and Related Problems.. AAIM, volume 12290 of Lecture Notes in Computer Science, page 1-12. Springer, (2020)Optimum sweeps of simple polygons with two guards., and . Inf. Process. Lett., 114 (3): 130-136 (2014)Searching a Simple Polygon by a k-Searcher.. ISAAC, volume 1969 of Lecture Notes in Computer Science, page 503-514. Springer, (2000)Spatial Point Location and Its Applications., , and . SIGAL International Symposium on Algorithms, volume 450 of Lecture Notes in Computer Science, page 241-250. Springer, (1990)Constructing Shortest Watchman Routes by Divide-and-Conquer., and . ISAAC, volume 762 of Lecture Notes in Computer Science, page 68-77. Springer, (1993)An Incremental Algorithm for Constructing Shortest Watchman Routes., , and . ISA, volume 557 of Lecture Notes in Computer Science, page 163-175. Springer, (1991)Approximation Algorithms for Cutting Out Polygons with Lines and Rays.. COCOON, volume 3595 of Lecture Notes in Computer Science, page 534-543. Springer, (2005)