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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. 4(4), 337–343.

Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &; Computational Geometry. 4(1), 311–336.

Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &; Computational Geometry. 4(1), 139–181.

Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete &; Computational Geometry. 2(1), 113–126.

Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete &; Computational Geometry. 1(1), 25–44.