Author of the publication

An Approximation Algorithm for the Art Gallery Problem.

, and . Symposium on Computational Geometry, volume 77 of LIPIcs, page 20:1-20:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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

A Framework for Robust Realistic Geometric Computations., , and . CoRR, (2019)Augmenting a Geometric Matching is NP-complete. CoRR, (2012)The Art Gallery Problem is ∃ℝ-complete., , and . CoRR, (2017)Counting Houses of Pareto Optimal Matchings in the House Allocation Problem., , and . FUN, volume 8496 of Lecture Notes in Computer Science, page 301-312. Springer, (2014)Approximation and Hardness of Token Swapping., , , , , and . ESA, volume 57 of LIPIcs, page 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Extreme point and halving edge search in abstract order types., , and . Comput. Geom., 46 (8): 970-978 (2013)Between shapes, using the Hausdorff distance., , , , and . Comput. Geom., (2022)Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition)., , , , and . SoCG, volume 164 of LIPIcs, page 78:1-78:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)The Complexity of the Hausdorff Distance., , and . Discret. Comput. Geom., 71 (1): 177-213 (January 2024)The Complexity of Recognizing Geometric Hypergraphs., , , , and . GD (1), volume 14465 of Lecture Notes in Computer Science, page 163-179. Springer, (2023)