Author of the publication

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

Computing the Greedy Spanner in Near-Quadratic Time., , , , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 390-401. Springer, (2008)Spanners of Additively Weighted Point Sets., , and . SWAT, volume 5124 of Lecture Notes in Computer Science, page 367-377. Springer, (2008)An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times., , , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 38-49. Springer, (2010)Spanners of Complete k -Partite Geometric Graphs., , , , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 170-181. Springer, (2008)Art Gallery Localization., , , and . CoRR, (2017)The dilation of the Delaunay triangulation is greater than π/2, , , , and . CoRR, (2010)Computing the k-Crossing Visibility Region of a Point in a Polygon., , , and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 10-21. Springer, (2019)Constructing Plane Spanners of Bounded Degree and Low Weight., , and . Algorithmica, 42 (3-4): 249-264 (2005)On the separation of a polyhedron from its single-part mold., , and . CASE, page 61-66. IEEE, (2017)A Polynomial Bound for Untangling Geometric Planar Graphs., , , , , and . Electron. Notes Discret. Math., (2008)