Bendich, P., Edelsbrunner, H., Morozov, D., &; Patel, A. (2013). Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. International Press.https://doi.org/10.4310/HHA.2013.v15.n1.a3 
LibreCat: https://research-explorer.ista.ac.at/record/2859
DOI: 10.4310/HHA.2013.v15.n1.a3
arXiv: 1102.3389

Fang, S., Clark, R., Zheng, Y., Iyer Pascuzzi, A., Weitz, J., Kochian, L.,https://doi.org/10.1073/pnas.1222821110__Benfey, P. (2013). Genotypic recognition and spatial responses by rice roots. PNAS. National Academy of Sciences.https://doi.org/10.1073/pnas.1222821110 
LibreCat: https://research-explorer.ista.ac.at/record/2887
DOI: 10.1073/pnas.1222821110
PMID: 23362379

Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., &; Lampert, C. (2013). Computing the M most probable modes of a graphical model (Vol. 31, pp. 161–169). Presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States: JMLR.
LibreCat: https://research-explorer.ista.ac.at/record/2901

Kerber, M., &; Edelsbrunner, H. (2013). 3D kinetic alpha complexes and their implementation. In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments (pp. 70–77). New Orleans, LA, United States: Society of Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611972931.6 
LibreCat: https://research-explorer.ista.ac.at/record/2906
DOI: 10.1137/1.9781611972931.6

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

Chen, C., &; Kerber, M. (2013). An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2012.02.010 
LibreCat: https://research-explorer.ista.ac.at/record/2939
DOI: 10.1016/j.comgeo.2012.02.010

Edelsbrunner, H. (2013). Persistent homology in image processing. In Graph-Based Representations in Pattern Recognition (Vol. 7877, pp. 182–183). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-38221-5_19 
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

Edelsbrunner, H., &; Strelkova, N. (2012). On the configuration space of Steiner minimal trees. Russian Mathematical Surveys. IOP Publishing Ltd.https://doi.org/10.1070/RM2012v067n06ABEH004820 
LibreCat: https://research-explorer.ista.ac.at/record/2849
DOI: 10.1070/RM2012v067n06ABEH004820

Edelsbrunner, H., &; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE.https://doi.org/10.1109/ISVD.2012.11 
LibreCat: https://research-explorer.ista.ac.at/record/2903
DOI: 10.1109/ISVD.2012.11

Dolbilin, N., Edelsbrunner, H., &; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. IOP Publishing.https://doi.org/10.1070/RM2012v067n04ABEH004807 
LibreCat: https://research-explorer.ista.ac.at/record/2941
DOI: 10.1070/RM2012v067n04ABEH004807

Zankl, G., Haxhimusa, Y., &; Ion, A. (2012). Interactive labeling of image segmentation hierarchies (Vol. 7476, pp. 11–20). Presented at the Pattern Recognition, Graz, Austria: Springer.https://doi.org/10.1007/978-3-642-32717-9_2 
LibreCat: https://research-explorer.ista.ac.at/record/2971
DOI: 10.1007/978-3-642-32717-9_2

Brown, G., Kerber, M., &; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. Cambridge University Press.https://doi.org/10.1112/S0010437X11007226 
LibreCat: https://research-explorer.ista.ac.at/record/3120
DOI: 10.1112/S0010437X11007226

Edelsbrunner, H., &; Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In Proceedings of the twenty-eighth annual symposium on Computational geometry  (pp. 249–258). Chapel Hill, NC, USA: ACM.https://doi.org/10.1145/2261250.2261287 
LibreCat: https://research-explorer.ista.ac.at/record/3133
DOI: 10.1145/2261250.2261287

Edelsbrunner, H., Fasy, B., &; Rote, G. (2012). Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. In Proceedings of the twenty-eighth annual symposium on Computational geometry  (pp. 91–100). Chapel Hill, NC, USA: ACM.https://doi.org/10.1145/2261250.2261265 
LibreCat: https://research-explorer.ista.ac.at/record/3134
DOI: 10.1145/2261250.2261265

Edelsbrunner, H., &; Kerber, M. (2012). Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9382-4 
LibreCat: https://research-explorer.ista.ac.at/record/3256
DOI: 10.1007/s00454-011-9382-4

Ion, A., Carreira, J., &; Sminchisescu, C. (2012). Image segmentation by figure-ground composition into maximal cliques. Presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126486 
LibreCat: https://research-explorer.ista.ac.at/record/3265
DOI: 10.1109/ICCV.2011.6126486

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-012-9441-5 
LibreCat: https://research-explorer.ista.ac.at/record/3115
DOI: 10.1007/s00454-012-9441-5
arXiv: 1109.2158

Kerber, M., &; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. https://doi.org/10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/j.jsc.2011.11.001 
LibreCat: https://research-explorer.ista.ac.at/record/3331
DOI: 10.1016/j.jsc.2011.11.001

Busaryev, O., Cabello, S., Chen, C., Dey, T., &; Wang, Y. (2012). Annotating simplices with a homology basis and its applications (Vol. 7357, pp. 189–200). Presented at the SWAT: Symposium and Workshops on Algorithm Theory, Helsinki, Finland: Springer.https://doi.org/10.1007/978-3-642-31155-0_17 
LibreCat: https://research-explorer.ista.ac.at/record/3129
DOI: 10.1007/978-3-642-31155-0_17
arXiv: 1107.3793

Mileyko, Y., Edelsbrunner, H., Price, C., &; Weitz, J. (2012). Hierarchical ordering of reticular networks. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0036715 
LibreCat: https://research-explorer.ista.ac.at/record/3159
DOI: 10.1371/journal.pone.0036715

Bendich, P., Cabello, S., &; Edelsbrunner, H. (2012). A point calculus for interlevel set homology. Pattern Recognition Letters. Elsevier.https://doi.org/10.1016/j.patrec.2011.10.007 
LibreCat: https://research-explorer.ista.ac.at/record/3310
DOI: 10.1016/j.patrec.2011.10.007

Pausinger, F. (2012). Elementary solutions of the Bernstein problem on two intervals. Journal of Mathematical Physics, Analysis, Geometry. B. Verkin Institute for Low Temperature Physics and Engineering.
LibreCat: https://research-explorer.ista.ac.at/record/6588
WoS: 000301173600004

Edelsbrunner, H., &; Strelkova, N. (2012). On the configuration space for the shortest networks. Russian Mathematical Surveys. Russian Academy of Sciences.https://doi.org/10.4213/rm9503 
LibreCat: https://research-explorer.ista.ac.at/record/2912
DOI: 10.4213/rm9503

Quadrianto, N., Lampert, C., &; Chen, C. (2012). The most persistent soft-clique in a set of sampled graphs. In Proceedings of the 29th International Conference on Machine Learning (pp. 211–218). Edinburgh, United Kingdom: ML Research Press.
LibreCat: https://research-explorer.ista.ac.at/record/3127

Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. Journal de Theorie Des Nombres Des Bordeaux. Université de Bordeaux.https://doi.org/10.5802/jtnb.819 
LibreCat: https://research-explorer.ista.ac.at/record/2904
DOI: 10.5802/jtnb.819

Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V.,  Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. Russian Academy of Sciences.
LibreCat: https://research-explorer.ista.ac.at/record/2902

Ion, A., Carreira, J., &; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In NIPS Proceedings (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation.
LibreCat: https://research-explorer.ista.ac.at/record/3266

Sheng, Y., Cutler, B., Chen, C., &; Nasman, J. (2011). Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. Wiley-Blackwell.https://doi.org/10.1111/j.1467-8659.2011.01985.x 
LibreCat: https://research-explorer.ista.ac.at/record/3269
DOI: 10.1111/j.1467-8659.2011.01985.x

Chen, C., &; Freedman, D. (2011). Hardness results for homology localization. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-010-9322-8 
LibreCat: https://research-explorer.ista.ac.at/record/3267
DOI: 10.1007/s00454-010-9322-8

Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C.,https://doi.org/10.1007/978-3-642-25249-5_3__Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, &; M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer.https://doi.org/10.1007/978-3-642-25249-5_3 
LibreCat: https://research-explorer.ista.ac.at/record/3335
DOI: 10.1007/978-3-642-25249-5_3
arXiv: 1306.3640

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM.https://doi.org/10.1145/1998196.1998225 
LibreCat: https://research-explorer.ista.ac.at/record/3329
DOI: 10.1145/1998196.1998225

Kerber, M., &; Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer.https://doi.org/10.1007/s00373-011-1020-7 
LibreCat: https://research-explorer.ista.ac.at/record/3332
DOI: 10.1007/s00373-011-1020-7

Kerber, M., &; Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer.https://doi.org/10.1145/1993886.1993920 
LibreCat: https://research-explorer.ista.ac.at/record/3330
DOI: 10.1145/1993886.1993920
arXiv: 1104.1362

Berberich, E., Hemmer, M., &; Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM.https://doi.org/10.1145/1998196.1998224 
LibreCat: https://research-explorer.ista.ac.at/record/3328
DOI: 10.1145/1998196.1998224

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

Bendich, P., Edelsbrunner, H., Kerber, M., &; Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_2 
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 (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.
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. IEEE.https://doi.org/10.1109/TVCG.2010.139 
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 (Vol. 5903, pp. 36–50). Presented at the 3DPH: Modelling the Physiological Human, Zermatt, Switzerland: Springer.https://doi.org/10.1007/978-3-642-10470-1_4 
LibreCat: https://research-explorer.ista.ac.at/record/3968
DOI: 10.1007/978-3-642-10470-1_4