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.
277 Publications
2011 | Published | Book Chapter | IST-REx-ID: 3335 | 
Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3336
Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3367
Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3377 |
Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Journal Article | IST-REx-ID: 3781
Fasy BT. 2011. The difference in length of curves in R^n. Acta Sci. Math. (Szeged). 77(1–2), 359–367.
View
2011 | Published | Book Chapter | IST-REx-ID: 3796 |
Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 10909
Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1594–1604.
View
| Files available
| DOI
2010 | Published | Book Chapter | IST-REx-ID: 3795 |
Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3849 |
Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3850
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.
View
2010 | Published | Conference Paper | IST-REx-ID: 3853 |
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Journal Article | IST-REx-ID: 3901 |
Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
[Submitted Version]
View
| Files available
| DOI
2009 | Published | Conference Paper | IST-REx-ID: 3968 |
Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.
[Submitted Version]
View
| Files available
| DOI