Author of the publication

Terrain Visibility Graphs: Persistence Is Not Enough.

, , , , and . SoCG, volume 164 of LIPIcs, page 6:1-6:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Improved Approximations for Guarding 1.5-Dimensional Terrains., , , , and . STACS, volume 3 of LIPIcs, page 361-371. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Opposing Half Guards., , and . CCCG, page 219-226. (2022)On Metric Clustering to Minimize the Sum of Radii., , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 282-293. Springer, (2008)Improved Approximations for Guarding 1.5-Dimensional Terrains., , , , and . Algorithmica, 60 (2): 451-463 (2011)Guarding Polyominoes Under k-Hop Visibility., , , , and . LATIN (1), volume 14578 of Lecture Notes in Computer Science, page 288-302. Springer, (2024)On Clustering to Minimize the Sum of Radii., , , , and . SIAM J. Comput., 41 (1): 47-60 (2012)Guarding Monotone Polygons with Half-Guards., , and . CCCG, page 168-173. (2017)An Approximation Scheme for Terrain Guarding., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 140-148. Springer, (2009)On clustering to minimize the sum of radii., , , , and . SODA, page 819-825. SIAM, (2008)On Vertex Guarding Staircase Polygons., , , , , and . LATIN, volume 13568 of Lecture Notes in Computer Science, page 746-760. Springer, (2022)