Dynamic skin triangulation
H. Cheng, T. Dey, H. Edelsbrunner, J. Sullivan, Discrete &; Computational Geometry 25 (2001) 525–568.

A continuous analogue of the Upper Bound Theorem
U. Wagner, E. Welzl, Discrete &; Computational Geometry 26 (2001) 205–219.

Edgewise subdivision of a simplex
H. Edelsbrunner, D. Grayson, Discrete &; Computational Geometry 24 (2000) 707–719.

Deformable smooth surface design
H. Edelsbrunner, Discrete &; Computational Geometry 21 (1999) 87–115.

Cutting dense point sets in half
H. Edelsbrunner, P. Valtr, E. Welzl, Discrete &; Computational Geometry 17 (1997) 243–255.

Inclusion-exclusion complexes for pseudodisk collections
H. Edelsbrunner, E. Ramos, Discrete &; Computational Geometry 17 (1997) 287–306.

Improved bounds on weak ;5-nets for convex sets
B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 13 (1995) 1–15.

The union of balls and its dual shape
H. Edelsbrunner, Discrete &; Computational Geometry 13 (1995) 415–440.

Counting triangle crossings and halving planes
T. Dey, H. Edelsbrunner, Discrete &; Computational Geometry 12 (1994) 281–289.

An upper bound for conforming Delaunay triangulations
H. Edelsbrunner, T. Tan, Discrete &; Computational Geometry 10 (1993) 197–213.

Edge insertion for optimal triangulations
M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete &; Computational Geometry 10 (1993) 47–65.

Diameter, width, closest line pair, and parametric searching
B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 10 (1993) 183–196.

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &; Computational Geometry 6 (1991) 407–422.

Points and triangles in the plane and halving planes in space
B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger, Discrete &; Computational Geometry 6 (1991) 435–442.

The complexity of many cells in arrangements of planes and related problems
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 197–216.

The complexity and construction of many faces in arrangements of lines and of segments
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 5 (1990) 161–196.

The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n2
H. Edelsbrunner, M. Sharir, Discrete &; Computational Geometry 5 (1990) 35–42.

Combinatorial complexity bounds for arrangements of curves and spheres
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl, Discrete &; Computational Geometry 5 (1990) 99–160.

Implicitly representing arrangements of lines or segments
H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &; Computational Geometry 4 (1989) 433–466.

On arrangements of Jordan arcs with three intersections per pair
H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &; Computational Geometry 4 (1989) 523–539.