Boissonnat, J.-D., Dyer, R., Ghosh, A., &; Wintraecken, M. (2023). Local criteria for triangulating general manifolds. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00431-7 

Arroyo Guevara, A. M., Klute, F., Parada, I., Vogtenhuber, B., Seidel, R., &; Wiedera, T. (2023). Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00394-9 

Kourimska, H. (2023). Discrete yamabe problem for polyhedral surfaces. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-023-00484-2 

Corbet, R., Kerber, M., Lesnick, M., &; Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00476-8 

Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &; Wagner, U. (2023). The crossing Tverberg theorem. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-023-00532-x 

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. Springer Nature.https://doi.org/10.1007/s00454-023-00566-1 

Brunck, F. R. (2023). Iterated medial triangle subdivision in surfaces of constant curvature. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-023-00500-5 

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. Springer Nature.https://doi.org/10.1007/s00454-022-00371-2 

Patakova, Z., Tancer, M., &; Wagner, U. (2022). Barycentric cuts through a convex body. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-021-00364-7 

Wagner, U., &; Welzl, E. (2022). Connectivity of triangulation flip graphs in the plane. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00436-2 

Fulek, R., &; Kyndl, J. (2022). The Z2-Genus of Kuratowski minors. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00412-w 

Avvakumov, S., &; Kudrya, S. (2021). Vanishing of all equivariant obstructions and the mapping degree. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-021-00299-z 

Edelsbrunner, H., &; Osang, G. F. (2021). The multi-cover persistence of Euclidean balls. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-021-00281-9 

Boissonnat, J.-D., Kachanovich, S., &; Wintraecken, M. (2021). Triangulating submanifolds: An elementary and quantified version of Whitney’s method. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00250-8 

Akopyan, A., Bobenko, A. I., Schief, W. K., &; Techter, J. (2021). On mutually diagonal nets on (confocal) quadrics and 3-dimensional webs. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00240-w 

Boissonnat, J.-D., Dyer, R., Ghosh, A., Lieutier, A., &; Wintraecken, M. (2021). Local conditions for triangulating submanifolds of Euclidean space. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00233-9 

Brown, A., &; Wang, B. (2021). Sheaf-theoretic stratification learning from geometric and topological perspectives. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-020-00206-y 

Lubiw, A., Masárová, Z., &; Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-018-0035-8 

Edelsbrunner, H., Fasy, B. T., &; Rote, G. (2013). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-013-9517-x 

Edelsbrunner, H., Letscher, D., &; Zomorodian, A. (2002). Topological persistence and simplification. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-002-2885-2 

Cheng, H., Dey, T., Edelsbrunner, H., &; Sullivan, J. (2001). Dynamic skin triangulation. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-001-0007-1 

Wagner, U., &; Welzl, E. (2001). A continuous analogue of the Upper Bound Theorem. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-001-0028-9 

Edelsbrunner, H., &; Grayson, D. (2000). Edgewise subdivision of a simplex. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s004540010063 

Edelsbrunner, H. (1999). Deformable smooth surface design. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/PL00009412 

Edelsbrunner, H., Valtr, P., &; Welzl, E. (1997). Cutting dense point sets in half. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/PL00009291 

Edelsbrunner, H., &; Ramos, E. (1997). Inclusion-exclusion complexes for pseudodisk collections. Discrete &; Computational Geometry. Springer.https://doi.org/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. Springer.https://doi.org/10.1007/BF02574025 

Edelsbrunner, H. (1995). The union of balls and its dual shape. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574053 

Dey, T., &; Edelsbrunner, H. (1994). Counting triangle crossings and halving planes. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02574381 

Edelsbrunner, H., &; Tan, T. (1993). An upper bound for conforming Delaunay triangulations. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573974 

Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., &; Tan, T. (1993). Edge insertion for optimal triangulations. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573962 

Chazelle, B., Edelsbrunner, H., Guibas, L., &; Sharir, M. (1993). Diameter, width, closest line pair, and parametric searching. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02573973 

Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., &; Welzl, E. (1991). Euclidean minimum spanning trees and bichromatic closest pairs. Discrete &; Computational Geometry. Springer.https://doi.org/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. Springer.https://doi.org/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. Springer.https://doi.org/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. Springer.https://doi.org/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. Springer.https://doi.org/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. Springer.https://doi.org/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. Springer.https://doi.org/10.1007/BF02187742 

Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel, R.,https://doi.org/10.1007/BF02187745__Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections per pair. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187745 

Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187734 

Edelsbrunner, H., Guibas, L., &; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187733 

Chazelle, B., Edelsbrunner, H., &; Guibas, L. (1989). The complexity of cutting complexes. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187720 

Chazelle, B., &; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187875 

Edelsbrunner, H., &; Seidel, R. (1986). Voronoi diagrams and arrangements. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/BF02187681