Author of the publication

Dynamic Geometric Set Cover and Hitting Set.

, , , , and . SoCG, volume 164 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications., , , and . CoRR, (2018)Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons., , and . WABI, volume 3692 of Lecture Notes in Computer Science, page 315-327. Springer, (2005)Modeling and Analyzing Massive Terrain Data Sets.. ISAAC, volume 4835 of Lecture Notes in Computer Science, page 1. Springer, (2007)Sparsification of motion-planning roadmaps by edge contraction., , , and . ICRA, page 4098-4105. IEEE, (2013)Efficient algorithms for bichromatic separability., , and . ACM Trans. Algorithms, 2 (2): 209-227 (2006)Computing a Center-Transversal Line., , , and . FSTTCS, volume 4337 of Lecture Notes in Computer Science, page 93-104. Springer, (2006)Star Unfolding of a Polytope with Applications (Extended Abstract)., , , and . SWAT, volume 447 of Lecture Notes in Computer Science, page 251-263. Springer, (1990)Computing the Discrete Fréchet Distance in Subquadratic Time., , , and . SIAM J. Comput., 43 (2): 429-449 (2014)Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains., , , and . SIGSPATIAL/GIS, page 25:1-25:10. ACM, (2016)Penetration Depth of Two Convex Polytopes in 3D., , , , and . Nord. J. Comput., 7 (3): 227-240 (2000)