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.
LibreCat: https://research-explorer.ista.ac.at/record/8248
DOI: 10.1007/s00454-020-00233-9
WoS: 000558119300001

Sheaf-theoretic stratification learning from geometric and topological perspectives
A. Brown, B. Wang, Discrete and Computational Geometry 65 (2021) 1166–1198.
LibreCat: https://research-explorer.ista.ac.at/record/7905
DOI: 10.1007/s00454-020-00206-y
WoS: 000536324700001
arXiv: 1712.07734

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.
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

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.
LibreCat: https://research-explorer.ista.ac.at/record/2815
DOI: 10.1007/s00454-013-9517-x

Euclidean minimum spanning trees and bichromatic closest pairs
P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete &; Computational Geometry 6 (1991) 407–422.
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

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.
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

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.
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

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.
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

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.
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778

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.
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

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.
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

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.
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

The upper envelope of piecewise linear functions: Tight bounds on the number of faces 
H. Edelsbrunner, Discrete &; Computational Geometry 4 (1989) 337–343.
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

The upper envelope of piecewise linear functions: Algorithms and applications
H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &; Computational Geometry 4 (1989) 311–336.
LibreCat: https://research-explorer.ista.ac.at/record/4081
DOI: 10.1007/BF02187733

The complexity of cutting complexes
B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &; Computational Geometry 4 (1989) 139–181.
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720

Linear space data structures for two types of range search
B. Chazelle, H. Edelsbrunner, Discrete &; Computational Geometry 2 (1987) 113–126.
LibreCat: https://research-explorer.ista.ac.at/record/4100
DOI: 10.1007/BF02187875

Voronoi diagrams and arrangements
H. Edelsbrunner, R. Seidel, Discrete &; Computational Geometry 1 (1986) 25–44.
LibreCat: https://research-explorer.ista.ac.at/record/4108
DOI: 10.1007/BF02187681