Boissonnat J-D, Dyer R, Ghosh A, Wintraecken M. 2023. Local criteria for triangulating general manifolds. Discrete &; Computational Geometry. 69, 156–191.
LibreCat: https://research-explorer.ista.ac.at/record/12287
DOI: 10.1007/s00454-022-00431-7
WoS: 000862193600001

Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. 2023. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 69, 745–770.
LibreCat: https://research-explorer.ista.ac.at/record/11999
DOI: 10.1007/s00454-022-00394-9
WoS: 000840292800001
arXiv: 1909.07347

Kourimska H. 2023. Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. 70, 123–153.
LibreCat: https://research-explorer.ista.ac.at/record/12764
DOI: 10.1007/s00454-023-00484-2
WoS: 000948148000001

Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.
LibreCat: https://research-explorer.ista.ac.at/record/12709
DOI: 10.1007/s00454-022-00476-8
WoS: 000936496800001
arXiv: 2103.07823

Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2023. The crossing Tverberg theorem. Discrete and Computational Geometry.
LibreCat: https://research-explorer.ista.ac.at/record/13974
DOI: 10.1007/s00454-023-00532-x
WoS: 001038546500001
arXiv: 1812.04911

Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2023. On angles in higher order Brillouin tessellations and related tilings in the plane. Discrete and Computational Geometry.
LibreCat: https://research-explorer.ista.ac.at/record/14345
DOI: 10.1007/s00454-023-00566-1
WoS: 001060727600004
arXiv: 2204.01076

Brunck FR. 2023. Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. 70(3), 1059–1089.
LibreCat: https://research-explorer.ista.ac.at/record/13270
DOI: 10.1007/s00454-023-00500-5
WoS: 001023742800003
arXiv: 2107.04112

Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2022. Continuous and discrete radius functions on Voronoi tessellations and Delaunay mosaics. Discrete and Computational Geometry. 67, 811–842.
LibreCat: https://research-explorer.ista.ac.at/record/10773
DOI: 10.1007/s00454-022-00371-2
WoS: 000752175300002

Patakova Z, Tancer M, Wagner U. 2022. Barycentric cuts through a convex body. Discrete and Computational Geometry. 68, 1133–1154.
LibreCat: https://research-explorer.ista.ac.at/record/10776
DOI: 10.1007/s00454-021-00364-7
WoS: 000750681500001
arXiv: 2003.13536

Wagner U, Welzl E. 2022. Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. 68(4), 1227–1284.
LibreCat: https://research-explorer.ista.ac.at/record/12129
DOI: 10.1007/s00454-022-00436-2
WoS: 000883222200003

Fulek R, Kyndl J. 2022. The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. 68, 425–447.
LibreCat: https://research-explorer.ista.ac.at/record/11593
DOI: 10.1007/s00454-022-00412-w
WoS: 000825014500001
arXiv: 1803.05085

Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and the mapping degree. Discrete &; Computational Geometry. 66(3), 1202–1216.
LibreCat: https://research-explorer.ista.ac.at/record/11446
DOI: 10.1007/s00454-021-00299-z
arXiv: 1910.12628

Edelsbrunner H, Osang GF. 2021. The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. 65, 1296–1313.
LibreCat: https://research-explorer.ista.ac.at/record/9317
DOI: 10.1007/s00454-021-00281-9
WoS: 000635460400001

Boissonnat J-D, Kachanovich S, Wintraecken M. 2021. Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete &; Computational Geometry. 66(1), 386–434.
LibreCat: https://research-explorer.ista.ac.at/record/8940
DOI: 10.1007/s00454-020-00250-8
WoS: 000597770300001

Akopyan A, Bobenko AI, Schief WK, Techter J. 2021. On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. 66, 938–976.
LibreCat: https://research-explorer.ista.ac.at/record/8338
DOI: 10.1007/s00454-020-00240-w
WoS: 000564488500002
arXiv: 1908.00856

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

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

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

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

Edelsbrunner H, Letscher D, Zomorodian A. 2002. Topological persistence and simplification. Discrete &; Computational Geometry. 28(4), 511–533.
LibreCat: https://research-explorer.ista.ac.at/record/3996
DOI: 10.1007/s00454-002-2885-2

Cheng H, Dey T, Edelsbrunner H, Sullivan J. 2001. Dynamic skin triangulation. Discrete &; Computational Geometry. 25(4), 525–568.
LibreCat: https://research-explorer.ista.ac.at/record/4007
DOI: 10.1007/s00454-001-0007-1

Wagner U, Welzl E. 2001. A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. 26(2), 205–219.
LibreCat: https://research-explorer.ista.ac.at/record/2419
DOI: 10.1007/s00454-001-0028-9

Edelsbrunner H, Grayson D. 2000. Edgewise subdivision of a simplex. Discrete &; Computational Geometry. 24(4), 707–719.
LibreCat: https://research-explorer.ista.ac.at/record/4004
DOI: 10.1007/s004540010063

Edelsbrunner H. 1999. Deformable smooth surface design. Discrete &; Computational Geometry. 21(1), 87–115.
LibreCat: https://research-explorer.ista.ac.at/record/4014
DOI: 10.1007/PL00009412

Edelsbrunner H, Valtr P, Welzl E. 1997. Cutting dense point sets in half. Discrete &; Computational Geometry. 17(3), 243–255.
LibreCat: https://research-explorer.ista.ac.at/record/4022
DOI: 10.1007/PL00009291

Edelsbrunner H, Ramos E. 1997. Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. 17(3), 287–306.
LibreCat: https://research-explorer.ista.ac.at/record/4023
DOI: 10.1007/PL00009295

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

Edelsbrunner H. 1995. The union of balls and its dual shape. Discrete &; Computational Geometry. 13(1), 415–440.
LibreCat: https://research-explorer.ista.ac.at/record/4028
DOI: 10.1007/BF02574053

Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes. Discrete &; Computational Geometry. 12(1), 281–289.
LibreCat: https://research-explorer.ista.ac.at/record/4032
DOI: 10.1007/BF02574381

Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. 10(1), 197–213.
LibreCat: https://research-explorer.ista.ac.at/record/4040
DOI: 10.1007/BF02573974

Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion for optimal triangulations. Discrete &; Computational Geometry. 10(1), 47–65.
LibreCat: https://research-explorer.ista.ac.at/record/4044
DOI: 10.1007/BF02573962

Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. 10(1), 183–196.
LibreCat: https://research-explorer.ista.ac.at/record/4045
DOI: 10.1007/BF02573973

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

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

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

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

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

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

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

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

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

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

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

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

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