Author of the publication

The Shortest Separating Cycle Problem.

, , , , and . WAOA, volume 10138 of Lecture Notes in Computer Science, page 1-13. Springer, (2016)

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 Discrete Geodesic Problem., , and . SIAM J. Comput., 16 (4): 647-668 (1987)Preprocessing Imprecise Points and Splitting Triangulations., , and . SIAM J. Comput., 39 (7): 2990-3000 (2010)Approximation algorithms for location problems in sensor networks., , and . BROADNETS, page 767-776. IEEE, (2005)Time-Critical Rendering of Irregular Grids., , , and . SIBGRAPI, page 243-250. IEEE Computer Society, (2000)Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box., , , , , , and . FUN, volume 7288 of Lecture Notes in Computer Science, page 16-27. Springer, (2012)Distributed localization using noisy distance and angle information., , , and . MobiHoc, page 262-273. ACM, (2006)Greedy Cuts: An Advancing Front Terrain Triangulation Algorithm., and . ACM-GIS, page 137-144. ACM, (1998)Not being (super)thin or solid is hard: A study of grid Hamiltonicity., , , , , , , , and . Comput. Geom., 42 (6-7): 582-605 (2009)New results on shortest paths in three dimensions., and . Symposium on Computational Geometry, page 124-133. ACM, (2004)Simplifying a polygonal subdivision while keeping it simple., and . Symposium on Computational Geometry, page 40-49. ACM, (2001)