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

The Delauney Triangulation Closely Approximates the Complete Euclidean Graph., and . WADS, volume 382 of Lecture Notes in Computer Science, page 47-56. Springer, (1989)Minimum Ply Covering of Points with Unit Squares., , and . CoRR, (2022)Computing Maximum Independent Set on Outerstring Graphs and Their Relatives., , , , , , and . WADS, volume 11646 of Lecture Notes in Computer Science, page 211-224. Springer, (2019)Boundary Labeling for Rectangular Diagrams., , , , and . SWAT, volume 101 of LIPIcs, page 12:1-12:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Clustering Algorithms Based on Minimum and Maximum Spanning Trees., , , and . SCG, page 252-257. ACM, (1988)Finding a Maximum Clique in a Disk Graph., , and . SoCG, volume 258 of LIPIcs, page 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Minimum spanning trees on polyhedra., and . CCCG, (1999)The Bichromatic Rectangle Problem in High Dimensions., and . CCCG, page 157-160. (2009)Routing Properties of the Localized Delaunay Triangulation over Heterogeneous Ad-Hoc Wireless Networks., and . ICCSA (1), volume 3980 of Lecture Notes in Computer Science, page 121-130. Springer, (2006)Decomposing a Polygon into Simpler Components.. SIAM J. Comput., 14 (4): 799-817 (1985)