Fodor, Ferenc The densest packing of 12 congruent circles in a circle. (English) Zbl 0974.52015 Beitr. Algebra Geom. 41, No. 2, 401-409 (2000). The author solves the problem of finding the densest packing of \(n\) congruent circles in a circle for \(n=12\). The optimal circle packings were known for \(n\leq 11\) and \(n=19\). Reviewer: A.H.Temesvári (Sopron) Cited in 9 Documents MSC: 52C15 Packing and covering in \(2\) dimensions (aspects of discrete geometry) 52A10 Convex sets in \(2\) dimensions (including convex curves) Keywords:densest packing; circle packings PDFBibTeX XMLCite \textit{F. Fodor}, Beitr. Algebra Geom. 41, No. 2, 401--409 (2000; Zbl 0974.52015) Full Text: EuDML EMIS Online Encyclopedia of Integer Sequences: Decimal expansion of minimal radius of a circle that contains 12 non-overlapping unit disks.