Densest packings of equal circles in a square
Given a square \(Q\) in the Euclidean plane put \(n\) circles into \(Q\) such that no two circles have common interior points and such that the maximal distance between any two midpoints of the circles is minimal. The author lists such configurations for \(n = 10,11,12,\dots,20\). The configurations were found with computer programs. The proofs of the optimality were also done with computer aid as described in the article.
scientific article; zbMATH DE number 598841