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

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

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

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

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

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.