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

A fast algorithm for approximating the detour of a polygonal chain., , , and . Comput. Geom., 27 (2): 123-134 (2004)A local strategy for cleaning expanding cellular domains by simple robots., , and . Theor. Comput. Sci., (2015)Partially Walking a Polygon., , and . ISAAC, volume 123 of LIPIcs, page 60:1-60:9. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)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)Computing Geometric Minimum-Dilation Graphs Is NP-Hard., and . GD, volume 4372 of Lecture Notes in Computer Science, page 196-207. Springer, (2006)The geometric dilation of three points., , , and . J. Comput. Geom., 10 (1): 532-549 (2019)Moving Along a Street.. Workshop on Computational Geometry, volume 553 of Lecture Notes in Computer Science, page 123-140. Springer, (1991)How to Fit In Another Meeting., , , and . CollaborateCom, IEEE Computer Society / ICST, (2006)Walking an Unknown Street with Bounded Detour. FOCS, page 304-313. IEEE Computer Society, (1991)