The lattice polytope problem.
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.
The problem of polygons with hidden vertices.
The Steiner Minimal Network for Convex Configurations.
There Exist 6n/13 Ordinary Points.
Toughness and Delaunay Triangulations.
Two Combinatorial Problems in the Plane.
Universal tessellations.
All maps of type (m,n) are covered by a universal map M(m,n) which lies on one of the three simply connected Riemann surfaces; in fact M(m,n) covers all maps of type (r,s) where r|m and s|n. In this paper we construct a tessellation M which is universal for all maps on all surfaces. We also consider the tessellation M(8,3) which covers all triangular maps. This coincides with the well-known Farey tessellation and we find many connections between M(8,3) and M.
Upper Bounds on Geometric Permutations for Convex Sets.
Vertex-vectors of quadrangular 3-polytopes with two types of edges
О сумме Минковского сильно выпуклых поверхностей