1. Baker, B.S., Schwarz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM J. Comput. 12, 508–525 (1983)
2. Basu, S., Pollack, R., Roy, M.F.: On the combinatorial and algebraic complexity of quantifier elimination. J. ACM 43(6), 1002–1045 (1996)
3. Baur, C., Fekete, S.: Approximation of geometric dispersion problems. Algorithmica 30, 451–470 (2001)
4. Becker, A., Fekete, S., Keldenich, P., Morr, S., Scheffer, C.: Packing geometric objects with optimal worst-case density. In: Proc. of the 35th International Symposium on Computational Geometry (SoCG 2019), pp. 63:1–63:6 (2019)
5. Boll, D.W., Donovan, J., Graham, R.L., Lubachevsky, B.D.: Improving dense packings of equal disks in a square. Electron. J. Comb. 7(R46), 9 (2000)