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

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 
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. Springer.https://doi.org/10.1007/BF02574700 
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. Springer.https://doi.org/10.1007/BF02187785 
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. Springer.https://doi.org/10.1007/BF02187784 
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. Springer.https://doi.org/10.1007/BF02187778 
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. Springer.https://doi.org/10.1007/BF02187783 
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. Springer.https://doi.org/10.1007/BF02187742 
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.,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 
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. Springer.https://doi.org/10.1007/BF02187734 
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. Springer.https://doi.org/10.1007/BF02187733 
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. Springer.https://doi.org/10.1007/BF02187720 
LibreCat: https://research-explorer.ista.ac.at/record/4093
DOI: 10.1007/BF02187720