Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




307 Publications

2026 | Published | Journal Article | IST-REx-ID: 20456 | OA | PlanS
R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “On the size of chromatic Delaunay mosaics,” Discrete and Computational Geometry, vol. 75. Springer Nature, pp. 24–47, 2026.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 20980 | OA
T. K. Dey, A. Haas, and M. Lipiński, “Computing a connection matrix and persistence efficiently from a morse decomposition,” SIAM Journal on Applied Dynamical Systems, vol. 25, no. 1. Society for Industrial & Applied Mathematics, pp. 108–130, 2026.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Thesis | PhD | IST-REx-ID: 21021 | OA
C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026.
[Published Version] View | Files available | DOI
 
2026 | Draft | Preprint | IST-REx-ID: 21051 | OA
E. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding vineyards,” arXiv. .
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Book Chapter | IST-REx-ID: 21056 | OA
E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Braiding Vineyards,” in Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, K. Green Larsen and B. Saha, Eds. Philadelphia, PA, United States: Society for Industrial and Applied Mathematics, 2026, pp. 6240–6263.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 21115 | OA | PlanS
Y. Bleile, P. Yadav, P. Koehl, and F. Rehfeldt, “Persistence diagrams as morphological signatures of cells: A method to measure and compare cells within a population,” PLoS Computational Biology, vol. 22. Public Library of Science, 2026.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
2026 | Published | Journal Article | IST-REx-ID: 21232 | OA | PlanS
Y. Bleile, “Towards stratified space learning: 2-complexes,” La Matematica, vol. 5. Springer Nature, 2026.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 21374 | OA
T. Antić et al., “Edge-constrained Hamiltonian paths on a point set,” in 51st International Conference on Current Trends in Theory and Practice of Computer Science, Krakow, Poland, 2026, vol. 16448, pp. 532–546.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2026 | Published | Journal Article | IST-REx-ID: 21407 | OA | PlanS
H. Edelsbrunner, M. Kahle, and S. Kanazawa, “Maximum persistent Betti numbers of Čech complexes,” Journal of Applied and Computational Topology, vol. 10. Springer Nature, 2026.
[Published Version] View | Files available | DOI | arXiv
 
2026 | Published | Conference Paper | IST-REx-ID: 21410 | OA
A. Jabal Ameli, F. Motiei, and M. Saghafian, “On the MST-ratio: Theoretical bounds and complexity of finding the maximum,” in 20th International Conference and Workshops on Algorithms and Computation, Perugia, Italy, 2026, vol. 16444, pp. 386–401.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 18626 | OA
H. Edelsbrunner, A. Garber, and M. Saghafian, “Order-2 Delaunay triangulations optimize angles,” Advances in Mathematics, vol. 461. Elsevier, 2025.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 19937
M. Mahini, H. Beigy, S. Qadami, and M. Saghafian, “Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality,” Information Sciences, vol. 719, no. 11. Elsevier, 2025.
View | DOI | WoS
 
2025 | Published | Conference Paper | IST-REx-ID: 20005 | OA
H. Edelsbrunner, A. Garber, and M. Saghafian, “On spheres with k points inside,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Conference Paper | IST-REx-ID: 20006 | OA
L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the persistence in time series experimentally,” in 41st International Symposium on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Published | Journal Article | IST-REx-ID: 20260 | OA | PlanS
E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Burning or collapsing the medial axis is unstable,” La Matematica, vol. 4. Springer Nature, pp. 811–828, 2025.
[Published Version] View | Files available | DOI
 
2025 | Published | Journal Article | IST-REx-ID: 20293 | OA | PlanS
A. Akopyan, H. Edelsbrunner, Z. Virk, and H. Wagner, “Tight bounds between the Jensen–Shannon divergence and the minmax divergence,” Entropy, vol. 27, no. 8. MDPI, 2025.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2025 | Published | Journal Article | IST-REx-ID: 20323 | OA | PlanS
A. Brown and O. Draganov, “Discrete microlocal Morse theory,” Journal of Pure and Applied Algebra, vol. 229, no. 10. Elsevier, 2025.
[Published Version] View | Files available | DOI | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20490 | OA
H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” European Journal of Combinatorics, vol. 132. Elsevier, 2025.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20585
S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic alpha complexes,” Foundations of Data Science, vol. 8. American Institute of Mathematical Sciences, pp. 30–62, 2025.
[Preprint] View | Files available | DOI | arXiv
 
2025 | Epub ahead of print | Journal Article | IST-REx-ID: 20657 | OA | PlanS
H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” Discrete & Computational Geometry. Springer Nature, 2025.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed