AbstractLet e(m) denote the maximal number of edges of a convex digital polygon included into an m × m square area of lattice points and let s(n) denote the minimal (side) size of a square in which a convex digital polygon with n edges can be included. We prove thate(m) = 12(4π2)13m23+O(m13log m)s(n) = 2τ1232n32+O(nlogn)
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of tw...
AbstractThis paper investigates the problem where one is given a finite set of n points in the plane...
This thesis presents solutions to various problems in the expanding field of combinatorial geometry....
AbstractLet e(m) denote the maximal number of edges of a convex digital polygon included into an m ×...
AbstractGiven a natural number n, an exact formula is derived for the minimal possible size MD(n) of...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
In this article we study convex integer maximization problems with com-posite objective functions of...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
AbstractThe following problem is addressed: given a finite set D of points in the plane and an integ...
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of tw...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
AbstractThis paper investigates the problem where one is given a finite set of n points in the plane...
AbstractWe show that the minimum number of distinct edge-directions of a convex polytope with n vert...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
\u3cp\u3eWe study several problems concerning convex polygons whose vertices lie in a Cartesian prod...
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of tw...
AbstractThis paper investigates the problem where one is given a finite set of n points in the plane...
This thesis presents solutions to various problems in the expanding field of combinatorial geometry....
AbstractLet e(m) denote the maximal number of edges of a convex digital polygon included into an m ×...
AbstractGiven a natural number n, an exact formula is derived for the minimal possible size MD(n) of...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
In this article we study convex integer maximization problems with com-posite objective functions of...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
AbstractThe following problem is addressed: given a finite set D of points in the plane and an integ...
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of tw...
AbstractThis paper expresses the minimal possible lp-perimeter of a convex lattice polygon with resp...
AbstractThis paper investigates the problem where one is given a finite set of n points in the plane...
AbstractWe show that the minimum number of distinct edge-directions of a convex polytope with n vert...
AbstractThe problem of determining the largest volume of a (d + 2)-point set in Ed of unit diameter ...
\u3cp\u3eWe study several problems concerning convex polygons whose vertices lie in a Cartesian prod...
We study several problems concerning convex polygons whose vertices lie in a Cartesian product of tw...
AbstractThis paper investigates the problem where one is given a finite set of n points in the plane...
This thesis presents solutions to various problems in the expanding field of combinatorial geometry....