Local conditions for triangulating submanifolds of Euclidean space
J.-D. Boissonnat, R. Dyer, A. Ghosh, A. Lieutier, M. Wintraecken, Discrete and Computational Geometry 66 (2021) 666–686.

Sheaf-theoretic stratification learning from geometric and topological perspectives
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.

A proof of the orbit conjecture for flipping edge-labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, Discrete &; Computational Geometry 61 (2019) 880–898.

Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
H. Edelsbrunner, B.T. Fasy, G. Rote, Discrete &; Computational Geometry 49 (2013) 797–822.

Topological persistence and simplification
H. Edelsbrunner, D. Letscher, A. Zomorodian, Discrete &; Computational Geometry 28 (2002) 511–533.

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.