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

Efficient Algorithms for Petersen's Matching Theorem., , , and . SODA, page 130-139. ACM/SIAM, (1999)On Generalized Diamond Spanners., , and . WADS, volume 4619 of Lecture Notes in Computer Science, page 325-336. Springer, (2007)Efficient Construction of Near-Optimal Binary and Multiway Search Trees., and . WADS, volume 5664 of Lecture Notes in Computer Science, page 230-241. Springer, (2009)Maximum Plane Trees in Multipartite Geometric Graphs., , , , , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 193-204. Springer, (2017)Optimal Algorithms to Embed Trees in a Point Set., , and . Graph Drawing, volume 1027 of Lecture Notes in Computer Science, page 64-75. Springer, (1995)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)Essential Constraints of Edge-Constrained Proximity Graphs., , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 55-67. Springer, (2016)Persistent realtime building interior generation., , and . Sandbox@SIGGRAPH, page 179-186. ACM, (2006)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)