Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
LibreCat: https://research-explorer.ista.ac.at/record/3377
DOI: 10.1007/s10208-011-9090-8

Bendich P, Harer J. 2011. Persistent intersection homology. Foundations of Computational Mathematics. 11(3), 305–336.
LibreCat: https://research-explorer.ista.ac.at/record/3378
DOI: 10.1007/s10208-010-9081-1

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.
LibreCat: https://research-explorer.ista.ac.at/record/3336
DOI: 10.1109/CVPR.2011.5995503

Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293.
LibreCat: https://research-explorer.ista.ac.at/record/9648
DOI: 10.1007/978-3-642-23672-3_35

Artner NM, Ion A, Kropatsch WG. 2011. Spatio-temporal extraction of articulated models in a graph pyramid. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNIP, LNCS, vol. 6658, 215–224.
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

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.
LibreCat: https://research-explorer.ista.ac.at/record/10909
DOI: 10.1137/1.9781611973075.129

Chen C, Freedman D. 2010. Topology noise removal for curve  and surface evolution.  Conference proceedings MCV 2010. MCV: Medical Computer Vision, LNCS, vol. 6533, 31–42.
LibreCat: https://research-explorer.ista.ac.at/record/3782
DOI: 10.1007/978-3-642-18421-5_4

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.
LibreCat: https://research-explorer.ista.ac.at/record/3795
DOI: 10.1007/978-3-642-15014-2_3

Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.
LibreCat: https://research-explorer.ista.ac.at/record/3848
DOI: 10.1007/978-3-642-15775-2_1

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

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.
LibreCat: https://research-explorer.ista.ac.at/record/3849
DOI: 10.1007/978-3-642-15155-2_2

Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.
LibreCat: https://research-explorer.ista.ac.at/record/3850

Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
LibreCat: https://research-explorer.ista.ac.at/record/3901
DOI: 10.1109/TVCG.2010.139

Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.
LibreCat: https://research-explorer.ista.ac.at/record/3968
DOI: 10.1007/978-3-642-10470-1_4