Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”10.1007/s00454-022-00412-w__Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 425–47, doi:10.1007/s00454-022-00412-w.

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.”10.1007/s00454-021-00299-z__Discrete &; Computational Geometry, vol. 66, no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z.

Edelsbrunner, Herbert, and Georg F. Osang. “The Multi-Cover Persistence of Euclidean Balls.”10.1007/s00454-021-00281-9__Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1296–1313, doi:10.1007/s00454-021-00281-9.

Boissonnat, Jean-Daniel, et al. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.”10.1007/s00454-020-00250-8__Discrete &; Computational Geometry, vol. 66, no. 1, Springer Nature, 2021, pp. 386–434, doi:10.1007/s00454-020-00250-8.

Akopyan, Arseniy, et al. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.”10.1007/s00454-020-00240-w__Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 938–76, doi:10.1007/s00454-020-00240-w.

Boissonnat, Jean-Daniel, et al. “Local Conditions for Triangulating Submanifolds of Euclidean Space.”10.1007/s00454-020-00233-9__Discrete and Computational Geometry, vol. 66, Springer Nature, 2021, pp. 666–86, doi:10.1007/s00454-020-00233-9.

Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.”10.1007/s00454-020-00206-y__Discrete and Computational Geometry, vol. 65, Springer Nature, 2021, pp. 1166–98, doi:10.1007/s00454-020-00206-y.

Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”10.1007/s00454-018-0035-8__Discrete &; Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.

Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”10.1007/s00454-013-9517-x__Discrete &; Computational Geometry, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi:10.1007/s00454-013-9517-x.

Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”10.1007/BF02574698__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 407–22, doi:10.1007/BF02574698.

Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes in Space.”10.1007/BF02574700__Discrete &; Computational Geometry, vol. 6, no. 1, Springer, 1991, pp. 435–42, doi:10.1007/BF02574700.

Edelsbrunner, Herbert, et al. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”10.1007/BF02187785__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 197–216, doi:10.1007/BF02187785.

Edelsbrunner, Herbert, et al. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”10.1007/BF02187784__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 161–96, doi:10.1007/BF02187784.

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”10.1007/BF02187778__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi:10.1007/BF02187778.

Clarkson, Kenneth, et al. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”10.1007/BF02187783__Discrete &; Computational Geometry, vol. 5, no. 1, Springer, 1990, pp. 99–160, doi:10.1007/BF02187783.

Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.”10.1007/BF02187742__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742.

Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.”10.1007/BF02187745__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:10.1007/BF02187745.

Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .”10.1007/BF02187734__Discrete &; Computational Geometry, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:10.1007/BF02187734.

Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.”10.1007/BF02187733__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:10.1007/BF02187733.

Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.”10.1007/BF02187720__Discrete &; Computational Geometry, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:10.1007/BF02187720.

Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.”10.1007/BF02187875__Discrete &; Computational Geometry, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:10.1007/BF02187875.

Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.”10.1007/BF02187681__Discrete &; Computational Geometry, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:10.1007/BF02187681.