Author of the publication

Computing a Center-Transversal Line.

, , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 93-104. Springer, (2006)

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

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)Computing a Center-Transversal Line., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 93-104. Springer, (2006)Higher-order Voronoi diagrams on triangulated surfaces., , and . Inf. Process. Lett., 109 (9): 440-445 (2009)Covering point sets with two disjoint disks or squares., , , , , and . Comput. Geom., 40 (3): 195-206 (2008)Minimum cuts in geometric intersection graphs., and . Comput. Geom., (2021)The Inverse Voronoi Problem in Graphs I: Hardness., , , and . Algorithmica, 82 (10): 3018-3040 (2020)Faster distance-based representative skyline and k-center along pareto front in the plane.. J. Glob. Optim., 86 (2): 441-466 (June 2023)A point calculus for interlevel set homology., , and . Pattern Recognit. Lett., 33 (11): 1436-1444 (2012)Maximum Matchings in Geometric Intersection Graphs., , and . STACS, volume 154 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)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)