Author of the publication

Geometric Networks and Metric Space Embeddings

, , , , and (Eds.) volume 06481 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2007)

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

Partially Walking a Polygon., , and . ISAAC, volume 123 of LIPIcs, page 60:1-60:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Moving Along a Street.. Workshop on Computational Geometry, volume 553 of Lecture Notes in Computer Science, page 123-140. Springer, (1991)The geometric dilation of three points., , , and . J. Comput. Geom., 10 (1): 532-549 (2019)A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon., and . SCG, page 124-132. ACM, (1993)A Fire Fighter's Problem., , and . SoCG, volume 34 of LIPIcs, page 768-780. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)06421 Abstracts Collection -- Robot Navigation., , , and . Robot Navigation, volume 06421 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)Computing Geometric Minimum-Dilation Graphs Is NP-Hard., and . GD, volume 4372 of Lecture Notes in Computer Science, page 196-207. Springer, (2006)Voronoi Diagrams in the Moscow Metric (Extended Abstract).. WG, volume 344 of Lecture Notes in Computer Science, page 434-441. Springer, (1988)On the Maximum Path Length of AVL Trees., and . CAAP, volume 299 of Lecture Notes in Computer Science, page 16-27. Springer, (1988)A local strategy for cleaning expanding cellular domains by simple robots., , and . Theor. Comput. Sci., (2015)