1. Ahn, H.-K., Kim, S.-S., Knauer, C., Schlipf, L., Shin, C.-S., Vigneron, A.: Covering and piercing disks with two centers. Comput. Geom. 46(3), 253–262 (2013)
2. Brass, P., Knauer, C., Na, H.-S., Shin, C.-S., Vigneron, A.: The aligned k-center problem. Int. J. Comput. Geom. Appl. 21(2), 157–178 (2011)
3. Cheong, O., et al.: Farthest-polygon Voronoi diagrams. Comput. Geom. 44(4), 234–247 (2011)
4. Eskandari, M., Khare, B.B., Kumar, N.: Separated red blue center clustering. In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, Fukuoka, Japan, 6–8 December 2021 (2021)
5. Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2–4 May 1988, pp. 434–444. ACM (1988)