Author of the publication

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)

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

Terrain Guarding is NP-Hard., and . SIAM J. Comput., 40 (5): 1316-1339 (2011)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)The Complexity of Guarding Monotone Polygons., and . CCCG, page 167-172. (2012)On the VC-Dimension of Visibility in Monotone Polygons., , and . CCCG, Carleton University, Ottawa, Canada, (2014)The VC-dimension of visibility on the boundary of monotone polygons., , and . Comput. Geom., (2019)On clustering to minimize the sum of radii., , , , and . SODA, page 819-825. SIAM, (2008)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)A Characterization of Visibility Graphs for Pseudo-polygons., , and . ESA, volume 9294 of Lecture Notes in Computer Science, page 607-618. Springer, (2015)On the Visibility Graphs of Pseudo-Polygons: Recognition and Reconstruction., , , and . SWAT, volume 227 of LIPIcs, page 7:1-7:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)