Author of the publication

The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension.

, , and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 198-209. Springer, (2009)

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

Abstract Milling with Turn Costs, , , , , , and . CoRR, (2009)Improving the Stretch Factor of a Geometric Network by Edge Augmentation., , and . SIAM J. Comput., 38 (1): 226-240 (2008)Computing Geometric Minimum-Dilation Graphs is NP-Hard., , , , and . Int. J. Comput. Geom. Appl., 20 (2): 147-173 (2010)The parameterized complexity of some geometric problems in unbounded dimension, , , and . CoRR, (2009)The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension., , and . IWPEC, volume 5917 of Lecture Notes in Computer Science, page 198-209. Springer, (2009)Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion., , , , , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 138-149. Springer, (2004)Parameterized Complexity of Geometric Problems., , and . Comput. J., 51 (3): 372-384 (2008)Matching point sets with respect to the Earth Mover's Distance., , , and . Comput. Geom., 39 (2): 118-133 (2008)Geometric Multicut., , , and . ICALP, volume 132 of LIPIcs, page 9:1-9:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Finding the best shortcut in a geometric network., , and . Symposium on Computational Geometry, page 327-335. ACM, (2005)