On coresets for k-means and k-median clustering
Projective clustering in high dimensions using core-sets
The One-Round Voronoi Game
Finding a Guard that Sees Most and a Shop that Sells Most
Guarding galleries and terrains
Information Processing Letters
Proceedings of the eighteenth annual symposium on Computational geometry - SCG ’02
Discrete & Computational Geometry
Discrete and Computational Geometry
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC ’04
Otfried Cheong
Alon Efrat
Kasturi Varadarajan
Soham Mazumdar
Nathan Linial
Jir Matousek
Bypassing the embedding
Bypassing UGC from Some Optimal Geometric Inapproximability Results
Faster Algorithms for Computing Plurality Points
On Target Coverage in Mobile Visual Sensor Networks