An output sensitive algorithm for persistent homology
C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.

Persistent homology in image processing
H. Edelsbrunner, in:, Graph-Based Representations in Pattern Recognition, Springer Nature, Berlin, Heidelberg, 2013, pp. 182–183.

On the configuration space of Steiner minimal trees
H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.

The adaptive topology of a digital image
H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.

On the optimality of functionals over triangulations of Delaunay sets
N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.

Interactive labeling of image segmentation hierarchies
G. Zankl, Y. Haxhimusa, A. Ion, in:, Springer, 2012, pp. 11–20.

Fano 3 folds in codimension 4 Tom and Jerry Part I
G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.

Alexander duality for functions: The persistent behavior of land and water and shore
H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258.

Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions
H. Edelsbrunner, B. Fasy, G. Rote, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100.

Dual complexes of cubical subdivisions of dn
H. Edelsbrunner, M. Kerber, Discrete &; Computational Geometry 47 (2012) 393–414.

Image segmentation by figure-ground composition into maximal cliques
A. Ion, J. Carreira, C. Sminchisescu, in:, IEEE, 2012.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete &; Computational Geometry 48 (2012) 964–989.

A worst case bound for topology computation of algebraic curves
M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.

Annotating simplices with a homology basis and its applications
O. Busaryev, S. Cabello, C. Chen, T. Dey, Y. Wang, in:, Springer, 2012, pp. 189–200.

Hierarchical ordering of reticular networks
Y. Mileyko, H. Edelsbrunner, C. Price, J. Weitz, PLoS One 7 (2012).

A point calculus for interlevel set homology
P. Bendich, S. Cabello, H. Edelsbrunner, Pattern Recognition Letters 33 (2012) 1436–1444.

Elementary solutions of the Bernstein problem on two intervals
F. Pausinger, Journal of Mathematical Physics, Analysis, Geometry 8 (2012) 63–78.

On the configuration space for the shortest networks
H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.

The most persistent soft-clique in a set of sampled graphs
N. Quadrianto, C. Lampert, C. Chen, in:, Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–218.

Weak multipliers for generalized van der Corput sequences
F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.

Fractal and computational geometry for generalizing cartographic objects
H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.

Probabilistic joint image segmentation and labeling
A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information Processing Systems Foundation, 2011, pp. 1827–1835.

Perceptual global illumination cancellation in complex projection environments
Y. Sheng, B. Cutler, C. Chen, J. Nasman, Computer Graphics Forum 30 (2011) 1261–1268.

Hardness results for homology localization
C. Chen, D. Freedman, Discrete &; Computational Geometry 45 (2011) 425–448.

Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web
R. Van De Weygaert, G. Vegter, H. Edelsbrunner, B. Jones, P. Pranav, C. Park, W. Hellwing, B. Eldering, N. Kruithof, P. Bos, J. Hidding, J. Feldbrugge, E. Ten Have, M. Van Engelen, M. Caroli, M. Teillaud, in:, M. Gavrilova, K. Tan, M. Mostafavi (Eds.), Transactions on Computational Science XIV, Springer, 2011, pp. 60–101.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196.

A note on the complexity of real algebraic hypersurfaces
M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.

Root refinement for real polynomials
M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.

A generic algebraic kernel for non linear geometric applications
E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.

Letter from the new editors-in-chief
H. Edelsbrunner, J. Pach, G. Ziegler, Discrete &; Computational Geometry 45 (2011) 1–2.

An output sensitive algorithm for persistent homology
C. Chen, M. Kerber, in:, ACM, 2011, pp. 207–216.

The difference in length of curves in R^n
B.T. Fasy, Acta Sci. Math. (Szeged) 77 (2011) 359–367.

Covering and packing with spheres by diagonal distortion in R^n
H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.), Rainbow of Computer Science, Springer, 2011, pp. 20–35.

Computing elevation maxima by searching the Gauss sphere
B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics 16 (2011) 1–13.

Efficient computation of persistent homology for cubical data
H. Wagner, C. Chen, E. Vuçini, in:, R. Peikert, H. Hauser, H. Carr, R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II, Springer, 2011, pp. 91–106.

Persistent homology computation with a twist
C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200.

Detailed reconstruction of 3D plant root shape
Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, P. Benfey, Detailed Reconstruction of 3D Plant Root Shape, IEEE, 2011.

Diffusion runs low on persistence fast
C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011.

Alpha shapes - a survey
H. Edelsbrunner, in:, R. van de Weygaert, G. Vegter, J. Ritzerveld, V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, Springer, n.d.

Quantifying transversality by measuring the robustness of intersections
H. Edelsbrunner, D. Morozov, A. Patel, Foundations of Computational Mathematics 11 (2011) 345–361.

Persistent intersection homology
P. Bendich, J. Harer, Foundations of Computational Mathematics 11 (2011) 305–336.

Enforcing topological constraints in random field image segmentation
C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–2096.

Incremental-decremental algorithm for computing AT-models and persistent homology
R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis of Images and Patterns, Springer Nature, 2011, pp. 286–293.

Spatio-temporal extraction of articulated models in a graph pyramid
N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.

Hardness results for homology localization
C. Chen, D. Freedman, in:, Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2010, pp. 1594–1604.

Topology noise removal for curve  and surface evolution
C. Chen, D. Freedman, in:,  Conference Proceedings MCV 2010, Springer, 2010, pp. 31–42.

The stability of the apparent contour of an orientable 2-manifold
H. Edelsbrunner, D. Morozov, A. Patel, in:, Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42.

The robustness of level sets
P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.

Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.

Persistent homology under non-uniform error
P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.

Polygonal reconstruction from approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.

Computing robustness and persistence for images
P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.

The persistent Morse complex segmentation of a 3-manifold
H. Edelsbrunner, J. Harer, in:, Springer, 2009, pp. 36–50.