AbstractThis paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth
AbstractGiven a rectangle R with area α and a set of n positive reals A={a1,a2,…,an} with ∑ai∈Aai=α,...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
Let P be a set of n points in the plane in general position, and consider the problem of finding an ...
AbstractWe show that the way to partition a unit square into k2+s rectangles, for s=1 or s=-1, so as...
(eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computi...
We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal ar...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
AbstractA set of rectangles S is said to be grid packed if there exists a rectangular grid (not nece...
International audienceIn this paper, we deal with two geometric problems arising from heterogeneous ...
We study an interesting geometric optimization problem. We are given a set of rectangles and a recta...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: ...
AbstractGiven a rectangle R with area α and a set of n positive reals A={a1,a2,…,an} with ∑ai∈Aai=α,...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
Let P be a set of n points in the plane in general position, and consider the problem of finding an ...
AbstractWe show that the way to partition a unit square into k2+s rectangles, for s=1 or s=-1, so as...
(eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computi...
We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal ar...
AbstractThis paper improves the previous bound (Jennings, in press), from 133132 to 204203, concerni...
AbstractWe use computational experiments to find the rectangles of minimum perimeter into which a gi...
AbstractWe prove that every set of squares with total area 1 can be packed into a rectangle of area ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
AbstractA set of rectangles S is said to be grid packed if there exists a rectangular grid (not nece...
International audienceIn this paper, we deal with two geometric problems arising from heterogeneous ...
We study an interesting geometric optimization problem. We are given a set of rectangles and a recta...
AbstractIn this paper it is proved that all the squares of size, 12n+1, n = 1,2,3,…, can be packed i...
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: ...
AbstractGiven a rectangle R with area α and a set of n positive reals A={a1,a2,…,an} with ∑ai∈Aai=α,...
We present new results on the problem of finding an enclos-ing rectangle of minimum area that will c...
Let P be a set of n points in the plane in general position, and consider the problem of finding an ...
DOI
Add to ORKG