From post

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.

 

Другие публикации лиц с тем же именем

Computing Shortest Paths in the Plane with Removable Obstacles., , , и . SWAT, том 101 из LIPIcs, стр. 5:1-5:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Near-Quadratic Algorithm for Fence Design., , и . Discret. Comput. Geom., 33 (3): 463-481 (2005)Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D., , , , , , и . Discret. Comput. Geom., 39 (1-3): 17-37 (2008)Star Unfolding of a Polytope with Applications (Extended Abstract)., , , и . SWAT, том 447 из Lecture Notes in Computer Science, стр. 251-263. Springer, (1990)Efficient algorithms for bichromatic separability., , и . ACM Trans. Algorithms, 2 (2): 209-227 (2006)Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons., , и . WABI, том 3692 из Lecture Notes in Computer Science, стр. 315-327. Springer, (2005)Modeling and Analyzing Massive Terrain Data Sets.. ISAAC, том 4835 из Lecture Notes in Computer Science, стр. 1. Springer, (2007)Approximation Algorithms for k-Line Center., , и . ESA, том 2461 из Lecture Notes in Computer Science, стр. 54-63. Springer, (2002)Computing a Center-Transversal Line., , , и . FSTTCS, том 4337 из Lecture Notes in Computer Science, стр. 93-104. Springer, (2006)Arrangements and Their Applications., и . Handbook of Computational Geometry, North Holland / Elsevier, (2000)