Edelsbrunner H. 2015. Shape, homology, persistence, and stability. 23rd International Symposium. GD: Graph Drawing and Network Visualization, LNCS, vol. 9411.

Graff G, Pilarczyk P. 2015. An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds. Topological Methods in Nonlinear Analysis. 45(1), 273–286.

Cao T, Edelsbrunner H, Tan T. 2015. Triangulations from topologically correct digital Voronoi diagrams. Computational Geometry. 48(7), 507–519.

Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Reprint of: Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(5), 429–442.

Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. Weighted straight skeletons in the plane. Computational Geometry: Theory and Applications. 48(2), 120–133.

Biedl T, Held M, Huber S, Kaaser D, Palfrader P. 2015. A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Information Processing Letters. 115(2), 243–247.

Aichholzer O, Biedl T, Hackl T, Held M, Huber S, Palfrader P, Vogtenhuber B. 2015.Representing directed trees as straight skeletons. In: Graph Drawing and Network Visualization. LNCS, vol. 9411, 335–347.

Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal of the ACM. 62(4), 26.

Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.

Akopyan A, Pirogov S, Rybko A. 2015. Invariant measures of genetic recombination process. Journal of Statistical Physics. 160(1), 163–167.

Pausinger F, Steinerberger S. 2015. On the distribution of local extrema in quantum chaos. Physics Letters, Section A. 379(6), 535–541.

Edelsbrunner H, Jablonski G, Mrozek M. 2015. The persistent homology of a self-map. Foundations of Computational Mathematics. 15(5), 1213–1244.

Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2015. Homological reconstruction and simplification in . Computational Geometry: Theory and Applications. 48(8), 606–621.

Symonova O, Topp C, Edelsbrunner H. 2015. DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. 10(6), e0127657.

Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots for the maize root shown in fig 2, Public Library of Science,10.1371/journal.pone.0127657.s001 .

Pausinger F, Svane A. 2015. A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. 31(6), 773–797.

Pausinger F. 2015. On the approximation of intrinsic volumes. Institute of Science and Technology Austria.

Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.

Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.

Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. 53(1), 64–79.

Dolbilin N, Edelsbrunner H, Glazyrin A, Musin O. 2014. Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. 14(3), 491–504.

Alexeev VV, Bogaevskaya VG, Preobrazhenskaya MM, Ukhalov AY, Edelsbrunner H, Yakimova O. 2014. An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. 203(6), 754–760.

Günther D, Jacobson A, Reininghaus J, Seidel H, Sorkine Hornung O, Weinkauf T. 2014. Fast and memory-efficient topological denoising of 2D and 3D scalar fields. IEEE Transactions on Visualization and Computer Graphics. 20(12), 2585–2594.

Bauer U, Kerber M, Reininghaus J. 2014. Distributed computation of persistent homology. Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, 31–38.

Bauer U, Kerber M, Reininghaus J. 2014.Clear and Compress: Computing Persistent Homology in Chunks. In: Topological Methods in Data Analysis and Visualization III. , 103–117.

Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic stability of persistence. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 355–364.

Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 464–473.

Bauer U, Edelsbrunner H. 2014. The morse theory of cech and Delaunay filtrations. Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 484–490.

Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.

cadek M, Krcál M, Matousek J, Sergeraert F, Vokínek L, Wagner U. 2014. Computing all maps into a sphere. Journal of the ACM. 61(3), 17.

Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.

Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.

Edelsbrunner H. 2014. A Short Course in Computational Geometry and Topology 1st ed., Cham: Springer Nature, IX, 110p.

Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.

Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization III. , 135–150.

Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes. Journal of Mathematical Imaging and Vision. 50(1), 164–177.

Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.

Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468.

Biedl T, Held M, Huber S. 2013. Recognizing straight skeletons and Voronoi diagrams and reconstructing their input. ISVD: Voronoi Diagrams in Science and Engineering, 2013 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2013) , , 37–46.

Biedl T, Held M, Huber S. 2013. Reconstructing polygons from embedded straight skeletons. 29th European Workshop on Computational Geometry. EuroCG: European Workshop on Computational Geometry, 95–98.

Pausinger F. 2013. Van der Corput sequences and linear permutations. Electronic Notes in Discrete Mathematics. 43, 43–50.

cadek M, Krcál M, Matousek J, Vokínek L, Wagner U. 2013. Extending continuous maps: Polynomiality and undecidability. 45th Annual ACM Symposium on theory of computing. STOC: Symposium on the Theory of Computing, 595–604.

Attali D, Bauer U, Devillers O, Glisse M, Lieutier A. 2013. Homological reconstruction and simplification in . Proceedings of the 29th annual symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, 117–125.

Topp C, Iyer Pascuzzi A, Anderson J, Lee C, Zurek P, Symonova O, Zheng Y, Bucksch A, Mileyko Y, Galkovskyi T, Moore B, Harer J, Edelsbrunner H, Mitchell Olds T, Weitz J, Benfey P. 2013. 3D phenotyping and quantitative trait locus mapping identify core regions of the rice genome controlling root architecture. PNAS. 110(18), 95–04.

Edelsbrunner H, Pausinger F. 2013. Stable length estimates of tube-like shapes. 17th IAPR International Conference on Discrete Geometry for Computer Imagery. DGCI: Discrete Geometry for Computer Imagery, LNCS, vol. 7749, XV–XIX.

Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.

Fang S, Clark R, Zheng Y, Iyer Pascuzzi A, Weitz J, Kochian L, Edelsbrunner H, Liao H, Benfey P. 2013. Genotypic recognition and spatial responses by rice roots. PNAS. 110(7), 2670–2675.

Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model.  AISTATS: Conference on Uncertainty in Artificial Intelligence,  JMLR: W&;CP, vol. 31, 161–169.

Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.

Edelsbrunner H, Fasy BT, Rote G. 2013. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Discrete &; Computational Geometry. 49(4), 797–822.

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

Edelsbrunner H. 2013. Persistent homology in image processing. Graph-Based Representations in Pattern Recognition. GbRPR: Graph-based Representations in Pattern RecognitionLNCS vol. 7877, 182–183.

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

Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.

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

Zankl G, Haxhimusa Y, Ion A. 2012. Interactive labeling of image segmentation hierarchies. Pattern Recognition vol. 7476, 11–20.

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

Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.

Edelsbrunner H, Fasy B, Rote G. 2012. Add isotropic Gaussian kernels at own risk: More and more resilient modes in higher dimensions. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 91–100.

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

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.