A purely combinatorial proof of the Hadwiger Debrunner ( p , q ) conjecture. Alon, N.; Kleitman, D.J. — 1997 The Electronic Journal of Combinatorics [electronic only]
Covering a Square by Small Perimeter Rectangles. N. Alon; D.J. Kleitman — 1986 Discrete & computational geometry
On-Line Steiner Trees in the Euclidean Plane. N. Alon; Y. Azar — 1993 Discrete & computational geometry
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane. N. Alon; M. Katchalski; W.R. Pulleyblank — 1989 Discrete & computational geometry
Cutting Disjoint Disks by Straight Lines. N. Alon; M. Katchalski; W.R. Pulleyblank — 1989 Discrete & computational geometry
On Short Edges in Straight-Edge Triangulations. N. Alon; M. Katchalski; A. Liu; ... — 1995 Mathematica Scandinavica
Can Visibility Graphs Be Represented Compactly?. N. Alon; S. Suri; P.K. Agarwal; B. Aronov — 1994 Discrete & computational geometry