Author of the publication

Dilation-Optimal Edge Deletion in Polygonal Cycles.

, , , , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 88-99. Springer, (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

Dilation-Optimal Edge Deletion in Polygonal Cycles., , , , and . Int. J. Comput. Geom. Appl., 20 (1): 69-87 (2010)Shortest Path to a Segment and Quickest Visibility Queries., , , , , , , and . SoCG, volume 34 of LIPIcs, page 658-673. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Matching Point Sets with Respect to the Earth Mover's Distance., , , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 520-531. Springer, (2005)On the Parameterized Complexity of d-Dimensional Point Set Pattern Matching., , and . IWPEC, volume 4169 of Lecture Notes in Computer Science, page 175-183. Springer, (2006)Acyclic Orientation of Drawings., , , and . SWAT, volume 4059 of Lecture Notes in Computer Science, page 268-279. Springer, (2006)On Rolling Cube Puzzles., , , , , , , , and . CCCG, page 141-144. Carleton University, Ottawa, Canada, (2007)Hardness of discrepancy computation and ε-net verification in high dimension., , , and . J. Complex., 28 (2): 162-176 (2012)A disk-covering problem with application in optical interferometry, , , and . CoRR, (2006)Computing k-Centers On a Line, , , , and . CoRR, (2009)Milling a Graph with Turn Costs: A Parameterized Complexity Perspective., , , , , , and . WG, volume 6410 of Lecture Notes in Computer Science, page 123-134. (2010)