Tessellations Generated by Hyperplanes.
The Complexity of Cutting Complexes.
The Furthest-Site Geodesic Voronoi Diagram.
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.