H. Edelsbrunner, B. T. Fasy, and G. Rote, “Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions,” Discrete &; Computational Geometry, vol. 49, no. 4. Springer, pp. 797–822, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2815
DOI: 10.1007/s00454-013-9517-x

C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” Computational Geometry: Theory and Applications, vol. 46, no. 4. Elsevier, pp. 435–447, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2939
DOI: 10.1016/j.comgeo.2012.02.010

H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877, pp. 182–183.
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

H. Edelsbrunner and N. Strelkova, “On the configuration space of Steiner minimal trees,” Russian Mathematical Surveys, vol. 67, no. 6. IOP Publishing Ltd., pp. 1167–1168, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2849
DOI: 10.1070/RM2012v067n06ABEH004820

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

N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” Russian Mathematical Surveys, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2941
DOI: 10.1070/RM2012v067n04ABEH004807

G. Zankl, Y. Haxhimusa, and A. Ion, “Interactive labeling of image segmentation hierarchies,” presented at the Pattern Recognition, Graz, Austria, 2012, vol. 7476, pp. 11–20.
LibreCat: https://research-explorer.ista.ac.at/record/2971
DOI: 10.1007/978-3-642-32717-9_2

G. Brown, M. Kerber, and M. Reid, “Fano 3 folds in codimension 4 Tom and Jerry Part I,” Compositio Mathematica, vol. 148, no. 4. Cambridge University Press, pp. 1171–1194, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3120
DOI: 10.1112/S0010437X11007226

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

H. Edelsbrunner, B. Fasy, and G. Rote, “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 , Chapel Hill, NC, USA, 2012, pp. 91–100.
LibreCat: https://research-explorer.ista.ac.at/record/3134
DOI: 10.1145/2261250.2261265

H. Edelsbrunner and M. Kerber, “Dual complexes of cubical subdivisions of dn,” Discrete &; Computational Geometry, vol. 47, no. 2. Springer, pp. 393–414, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3256
DOI: 10.1007/s00454-011-9382-4

A. Ion, J. Carreira, and C. Sminchisescu, “Image segmentation by figure-ground composition into maximal cliques,” presented at the ICCV: International Conference on Computer Vision, Barcelona, Spain, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3265
DOI: 10.1109/ICCV.2011.6126486

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” Discrete &; Computational Geometry, vol. 48, no. 4. Springer, pp. 964–989, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3115
DOI: 10.1007/s00454-012-9441-5
arXiv: 1109.2158

M. Kerber and M. Sagraloff, “A worst case bound for topology computation of algebraic curves,”  Journal of Symbolic Computation, vol. 47, no. 3. Elsevier, pp. 239–258, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3331
DOI: 10.1016/j.jsc.2011.11.001

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

Y. Mileyko, H. Edelsbrunner, C. Price, and J. Weitz, “Hierarchical ordering of reticular networks,” PLoS One, vol. 7, no. 6. Public Library of Science, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3159
DOI: 10.1371/journal.pone.0036715

P. Bendich, S. Cabello, and H. Edelsbrunner, “A point calculus for interlevel set homology,” Pattern Recognition Letters, vol. 33, no. 11. Elsevier, pp. 1436–1444, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3310
DOI: 10.1016/j.patrec.2011.10.007

F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/6588
WoS: 000301173600004

H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2912
DOI: 10.4213/rm9503

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