Ion A, Carreira J, Sminchisescu C. 2012. Image segmentation by figure-ground composition into maximal cliques. ICCV: International Conference on Computer Vision, 6126486.

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

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

Busaryev O, Cabello S, Chen C, Dey T, Wang Y. 2012. Annotating simplices with a homology basis and its applications. SWAT: Symposium and Workshops on Algorithm Theory, LNCS, vol. 7357, 189–200.

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

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

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

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

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

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

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

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

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

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

Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011.Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Transactions on Computational Science XIV. LNCS, vol. 6970, 60–101.

Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.

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

Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.

Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.

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

Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.

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

Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.

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

Wagner H, Chen C, Vuçini E. 2011.Efficient computation of persistent homology for cubical data. In: Topological Methods in Data Analysis and Visualization II. Theory, Algorithms, and Applications, , 91–106.

Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.

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

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

Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .

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

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

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.

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.

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.

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.

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.

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.

Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.

Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.

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.

Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.

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

Edelsbrunner H, Harer J. 2009. The persistent Morse complex segmentation of a 3-manifold. 3DPH: Modelling the Physiological Human, LNCS, vol. 5903, 36–50.