1. Agarwal, P.K., Ezra, E., Fox, K.: Geometric optimization revisited. In: Steffen, B., Woeginger, G.J. (eds.) Computing and Software Science - State of the Art and Perspectives, LNCS, vol. 10000, pp. 66–84. Springer, Cham (2019)
2. Basappa, M., Das, G.K.: Discrete unit square cover problem. Discret. Math. Algorithms Appl. 10(6), 1850072:1–1850072:18 (2018)
3. Biedl, T.C., Biniaz, A., Lubiw, A.: Minimum ply covering of points with disks and squares. Comput. Geom. 94, 101712 (2021)
4. Biniaz, A., Lin, Z.: Minimum ply covering of points with convex shapes. In: Proceedings of the 32nd Canadian Conference on Computational Geometry (CCCG), pp. 2–5 (2020)
5. Chan, T.M., He, Q.: Faster approximation algorithms for geometric set cover. In: Cabello, S., Chen, D.Z. (eds.) Proceedings of the 36th International Symposium on Computational Geometry (SoCG). LIPIcs, vol. 164, pp. 27:1–27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)