Title: More Optimal Packings of Equal Circles in a Square

Journal: Discrete & Computational Geometry 22 (1999), 439-457

The densest packings of n equal circles in a square have earlier been determined for n <= 20 and for n = 25, 36. Several of these packings have been proved with the aid of a computer. The computer-aided approach is here further developed and the range is extended to n <= 27. The optimal packings are depicted.