1. Near-linear algorithms for geometric hitting sets and set covers;Agarwal;Discrete Comput. Geom.,2020
2. A linear-time algorithm for computing the Voronoi diagram of a convex polygon;Aggarwal;Discrete Comput. Geom.,1989
3. Minimum-cost coverage of point sets by disks;Alt,2006
4. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs;Ambühl,2006
5. Geometric clustering to minimize the sum of cluster sizes;Bilò,2005