Edelsbrunner, H., Pach, J., &; Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-010-9313-9 
LibreCat: https://research-explorer.ista.ac.at/record/3334
DOI: 10.1007/s00454-010-9313-9

Chen, C., &; Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM.https://doi.org/10.1145/1998196.1998228 
LibreCat: https://research-explorer.ista.ac.at/record/3367
DOI: 10.1145/1998196.1998228

Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Sci. Math. (Szeged). Szegedi Tudományegyetem.
LibreCat: https://research-explorer.ista.ac.at/record/3781

Edelsbrunner, H., &; Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &; A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer.https://doi.org/10.1007/978-3-642-19391-0_2 
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

Wang, B., Edelsbrunner, H., &; Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM.https://doi.org/10.1145/1963190.1970375 
LibreCat: https://research-explorer.ista.ac.at/record/3965
DOI: 10.1145/1963190.1970375

Wagner, H., Chen, C., &; Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, &; R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 91–106). Springer.https://doi.org/10.1007/978-3-642-23175-9_7 
LibreCat: https://research-explorer.ista.ac.at/record/3271
DOI: 10.1007/978-3-642-23175-9_7

Chen, C., &; Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., &; Benfey, P. (2011). Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126475 
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

Chen, C., &; Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126271 
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, &; V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.
LibreCat: https://research-explorer.ista.ac.at/record/3311

Edelsbrunner, H., Morozov, D., &; Patel, A. (2011). Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-011-9090-8 
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. Springer.https://doi.org/10.1007/s10208-010-9081-1 
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. In CVPR: Computer Vision and Pattern Recognition (pp. 2089–2096). Colorado Springs, CO, United States: IEEE.https://doi.org/10.1109/CVPR.2011.5995503 
LibreCat: https://research-explorer.ista.ac.at/record/3336
DOI: 10.1109/CVPR.2011.5995503

Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &; Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In Computer Analysis of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature.https://doi.org/10.1007/978-3-642-23672-3_35 
LibreCat: https://research-explorer.ista.ac.at/record/9648
DOI: 10.1007/978-3-642-23672-3_35

Artner, N. M., Ion, A., &; Kropatsch, W. G. (2011). Spatio-temporal extraction of articulated models in a graph pyramid. In X. Jiang, M. Ferrer, &; A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition (Vol. 6658, pp. 215–224). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-20844-7_22 
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. In Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1594–1604). Austin, TX, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973075.129 
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. In https://doi.org/10.1007/978-3-642-18421-5_4__Conference proceedings MCV 2010 (Vol. 6533, pp. 31–42). Beijing, China: Springer.https://doi.org/10.1007/978-3-642-18421-5_4 
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 (pp. 27–42). Springer.https://doi.org/10.1007/978-3-642-15014-2_3 
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 (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer.https://doi.org/10.1007/978-3-642-15775-2_1 
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, T. A., &; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19