Author of the publication

On the Stretch Factor of Polygonal Chains.

, , , and . MFCS, volume 138 of LIPIcs, page 56:1-56:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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

Routing in polygonal domains., , , , , , , , , and . Comput. Geom., (2020)Memory-Constrained Algorithms for Simple Polygons, , , , , , and . CoRR, (2011)Five Proofs of Chernoff's Bound with Applications.. CoRR, (2018)Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 108-119. Springer, (2018)An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings., , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 505-516. Springer, (2015)Unique Sink Orientations of Grids is in Unique End of Potential Line., and . CoRR, (2022)Dynamic Connectivity in Disk Graphs., , , , , , and . CoRR, (2021)Recognizing Generalized Transmission Graphs of Line Segments and Circular Sectors., and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 683-696. Springer, (2018)Asymmetric Convex Intersection Testing., and . SOSA, volume 69 of OASIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)No-Dimensional Tverberg Theorems and Algorithms., and . SoCG, volume 164 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)