Conference paper
Finding minimal convex nested polygons
Alok Aggarwal, Heather Booth, et al.
SCG 1985
Let S be a set consisting of n points in the plane. We consider the problem of finding k points of S that form a "small" set under some given measure, and present efficient algorithms for several natural measures including the diameter and the variance. © 1991.
Alok Aggarwal, Heather Booth, et al.
SCG 1985
Alok Aggarwal, Jon Kleinberg, et al.
SIAM Journal on Computing
Alok Aggarwal, Prabhakar Raghavan
Information Processing Letters
Lakshmi Ramachandran, Manika Kapoor, et al.
DIALM 2000