Author of the publication

Irrational Guards are Sometimes Needed.

, , and . Symposium on Computational Geometry, volume 77 of LIPIcs, page 3:1-3: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

Representing Matroids over the Reals is ∃R-complete., , and . CoRR, (2023)Quasi-Parallel Segments and Characterization of Unique Bichromatic Matchings, , and . CoRR, (2013)Upper and Lower Bounds on Long Dual Paths in Line Arrangements., , and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 407-419. Springer, (2015)The art gallery problem is ∃ ℝ-complete., , and . STOC, page 65-73. ACM, (2018)∀∃ℝ-Completeness and Area-Universality., , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 164-175. Springer, (2018)On Classifying Continuous Constraint Satisfaction problems., and . FOCS, page 781-791. IEEE, (2021)Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems., and . SoCG, volume 51 of LIPIcs, page 52:1-52:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Tight Exact and Approximate Algorithmic Results on Token Swapping., , , , , and . CoRR, (2016)Framework for ∃R-Completeness of Two-Dimensional Packing Problems., , and . CoRR, (2020)The Complexity of Drawing a Graph in a Polygonal Region., , and . GD, volume 11282 of Lecture Notes in Computer Science, page 387-401. Springer, (2018)