1. Exact and approximation algorithms for clustering;Agarwal;Algorithmica,2002
2. Constrained k-center problem on a convex polygon;Basappa;Internat. J. Found Comput. Sci.,2020
3. M. Basappa, R.K. Jallu, G.K. Das, S.C. Nandy, The Euclidean k-supplier problem in R2, in: Proc. of the 12th Int. Symp. on Algorithms and Experiments for Wireless Sensor Networks, Vol. 10050, 2016, pp. 129–140.
4. Computational Geometry Algorithms and Applications;de Berg,2008
5. P. Bose, G. Toussaint, Computing the constrained euclidean, geodesic and link center of a simple polygon with applications, in: Proc. of Pacific Graphics International, 1996, pp. 102–112.