Fulek, Radoslav, and Jan Kyndl. “The Z2-Genus of Kuratowski Minors.”https://doi.org/10.1007/s00454-022-00412-w__Discrete and Computational Geometry. Springer Nature, 2022.https://doi.org/10.1007/s00454-022-00412-w .
LibreCat: https://research-explorer.ista.ac.at/record/11593
DOI: 10.1007/s00454-022-00412-w
WoS: 000825014500001
arXiv: 1803.05085

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.”https://doi.org/10.1007/s00454-021-00299-z__Discrete &; Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-021-00299-z .
LibreCat: https://research-explorer.ista.ac.at/record/11446
DOI: 10.1007/s00454-021-00299-z
arXiv: 1910.12628

Edelsbrunner, Herbert, and Georg F Osang. “The Multi-Cover Persistence of Euclidean Balls.”https://doi.org/10.1007/s00454-021-00281-9__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-021-00281-9 .
LibreCat: https://research-explorer.ista.ac.at/record/9317
DOI: 10.1007/s00454-021-00281-9
WoS: 000635460400001

Boissonnat, Jean-Daniel, Siargey Kachanovich, and Mathijs Wintraecken. “Triangulating Submanifolds: An Elementary and Quantified Version of Whitney’s Method.”https://doi.org/10.1007/s00454-020-00250-8__Discrete &; Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00250-8 .
LibreCat: https://research-explorer.ista.ac.at/record/8940
DOI: 10.1007/s00454-020-00250-8
WoS: 000597770300001

Akopyan, Arseniy, Alexander I. Bobenko, Wolfgang K. Schief, and Jan Techter. “On Mutually Diagonal Nets on (Confocal) Quadrics and 3-Dimensional Webs.”https://doi.org/10.1007/s00454-020-00240-w__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00240-w .
LibreCat: https://research-explorer.ista.ac.at/record/8338
DOI: 10.1007/s00454-020-00240-w
WoS: 000564488500002
arXiv: 1908.00856

Boissonnat, Jean-Daniel, Ramsay Dyer, Arijit Ghosh, Andre Lieutier, and Mathijs Wintraecken. “Local Conditions for Triangulating Submanifolds of Euclidean Space.”https://doi.org/10.1007/s00454-020-00233-9__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00233-9 .
LibreCat: https://research-explorer.ista.ac.at/record/8248
DOI: 10.1007/s00454-020-00233-9
WoS: 000558119300001

Brown, Adam, and Bei Wang. “Sheaf-Theoretic Stratification Learning from Geometric and Topological Perspectives.”https://doi.org/10.1007/s00454-020-00206-y__Discrete and Computational Geometry. Springer Nature, 2021.https://doi.org/10.1007/s00454-020-00206-y .
LibreCat: https://research-explorer.ista.ac.at/record/7905
DOI: 10.1007/s00454-020-00206-y
WoS: 000536324700001
arXiv: 1712.07734

Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”https://doi.org/10.1007/s00454-018-0035-8__Discrete &; Computational Geometry. Springer Nature, 2019.https://doi.org/10.1007/s00454-018-0035-8 .
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

Edelsbrunner, Herbert, Brittany Terese Fasy, and Günter Rote. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”https://doi.org/10.1007/s00454-013-9517-x__Discrete &; Computational Geometry. Springer, 2013.https://doi.org/10.1007/s00454-013-9517-x .
LibreCat: https://research-explorer.ista.ac.at/record/2815
DOI: 10.1007/s00454-013-9517-x

Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl. “Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.”https://doi.org/10.1007/BF02574698__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574698 .
LibreCat: https://research-explorer.ista.ac.at/record/4061
DOI: 10.1007/BF02574698

Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving Planes in Space.”https://doi.org/10.1007/BF02574700__Discrete &; Computational Geometry. Springer, 1991.https://doi.org/10.1007/BF02574700 .
LibreCat: https://research-explorer.ista.ac.at/record/4062
DOI: 10.1007/BF02574700

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity of Many Cells in Arrangements of Planes and Related Problems.”https://doi.org/10.1007/BF02187785__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187785 .
LibreCat: https://research-explorer.ista.ac.at/record/4066
DOI: 10.1007/BF02187785

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.”https://doi.org/10.1007/BF02187784__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187784 .
LibreCat: https://research-explorer.ista.ac.at/record/4072
DOI: 10.1007/BF02187784

Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n2.”https://doi.org/10.1007/BF02187778__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187778 .
LibreCat: https://research-explorer.ista.ac.at/record/4068
DOI: 10.1007/BF02187778

Clarkson, Kenneth, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir, and Emo Welzl. “Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.”https://doi.org/10.1007/BF02187783__Discrete &; Computational Geometry. Springer, 1990.https://doi.org/10.1007/BF02187783 .
LibreCat: https://research-explorer.ista.ac.at/record/4074
DOI: 10.1007/BF02187783

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.”https://doi.org/10.1007/BF02187742__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187742 .
LibreCat: https://research-explorer.ista.ac.at/record/4088
DOI: 10.1007/BF02187742

Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of Jordan Arcs with Three Intersections per Pair.”https://doi.org/10.1007/BF02187745__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187745 .
LibreCat: https://research-explorer.ista.ac.at/record/4089
DOI: 10.1007/BF02187745

Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .”https://doi.org/10.1007/BF02187734__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187734 .
LibreCat: https://research-explorer.ista.ac.at/record/4086
DOI: 10.1007/BF02187734

Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.”https://doi.org/10.1007/BF02187733__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187733 .
LibreCat: https://research-explorer.ista.ac.at/record/4081
DOI: 10.1007/BF02187733

Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.”https://doi.org/10.1007/BF02187720__Discrete &; Computational Geometry. Springer, 1989.https://doi.org/10.1007/BF02187720 .
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720