Author of the publication

Efficient k-Center Algorithms for Planar Points in Convex Position.

, , and . WADS, volume 14079 of Lecture Notes in Computer Science, page 262-274. Springer, (2023)

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

Computing the center region and its variants., and . Theor. Comput. Sci., (2019)Approximation Algorithms for Inscribing or Circumscribing an Axially Symmetric Polygon to a Convex Polygon., , , , , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 259-267. Springer, (2004)Stacking and Bundling Two Convex Polygons., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 882-891. Springer, (2005)Casting a Polyhedron with Directional Uncertainty., , and . ISAAC, volume 2518 of Lecture Notes in Computer Science, page 274-285. Springer, (2002)Finding Pairwise Intersections of Rectangles in a Query Rectangle., and . CoRR, (2018)Geometric matching algorithms for two realistic terrains., , , and . Theor. Comput. Sci., (2018)Maximum-area and maximum-perimeter rectangles in polygons., , and . Comput. Geom., (2021)Computing the Center Region and Its Variants., and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 254-265. Springer, (2017)The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon., , and . Algorithmica, 82 (5): 1434-1473 (2020)Assigning Weights to Minimize the Covering Radius in the Plane., and . ISAAC, volume 64 of LIPIcs, page 58:1-58:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)