AbstractThe problem of the densest packing of n equal circles in a square has been solved for n<10 in [4, 6]; and some solutions have been proposed for n ⩾ 10. In this paper we give some better packings for n = 10, 11, 13 and 14
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
The paper presents a new verified optimization method for the problem of finding the densest packing...
The paper is dealing with the problem of finding the densest packings of equal cir-cles in the unit ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
AbstractIn this paper the problem of packing n equal circles into the unit square will be considered...
In the paper we will give heuristic upper bounds for the density of packings of non-overlapping equa...
AbstractThe paper is dealing with the problem of finding the densest packings of equal circles in th...
AbstractWe present new, efficient packings for 16, 17 and 18 congruent circles in an equilateral tri...
AbstractThe problem of finding the maximum diameter of n equal mutually disjoint circles inside a un...
How do you optimally pack equal circles into the standard triangular torus? In this paper, we proved...
We provide a tight result for a fundamental problem arising from packing squares into a circular con...
AbstractWe study the problem of packing equal circles in a square from the mathematical programming ...
In a recent article, Tarnai and Gáspár used computer simulations to find thin coverings of a square ...
The paper presents a new verified optimization method for the problem of finding the densest packing...
The paper is dealing with the problem of finding the densest packings of equal cir-cles in the unit ...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractThis paper improves the bound, due to D. Jennings [J. Combin. Theory Ser. A68(1994), 465–469...
This paper deals with the densest packing of equal circles in a square problem. Sharp bounds for the...
DOI
Add to ORKG