Dolbilin, Nikolai, et al. “Functionals on Triangulations of Delaunay Sets.”10.17323/1609-4514-2014-14-3-491-504__Moscow Mathematical Journal, vol. 14, no. 3, Independent University of Moscow, 2014, pp. 491–504, doi:10.17323/1609-4514-2014-14-3-491-504.

Alexeev, V. V., et al. “An Algorithm for Cartographic Generalization That Preserves Global Topology.”10.1007/s10958-014-2165-8__Journal of Mathematical Sciences, vol. 203, no. 6, Springer, 2014, pp. 754–60, doi:10.1007/s10958-014-2165-8.

Günther, David, et al. “Fast and Memory-Efficient Topological Denoising of 2D and 3D Scalar Fields.”10.1109/TVCG.2014.2346432__IEEE Transactions on Visualization and Computer Graphics, vol. 20, no. 12, IEEE, 2014, pp. 2585–94, doi:10.1109/TVCG.2014.2346432.

Bauer, Ulrich, et al. “Distributed Computation of Persistent Homology.”10.1137/1.9781611973198.4__Proceedings of the Workshop on Algorithm Engineering and Experiments, edited by Catherine10.1137/1.9781611973198.4__McGeoch and Ulrich Meyer, Society of Industrial and Applied Mathematics, 2014, pp. 31–38, doi:10.1137/1.9781611973198.4.

Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in Chunks.”10.1007/978-3-319-04099-8_7__Topological Methods in Data Analysis and Visualization III, edited by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:10.1007/978-3-319-04099-8_7.

Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the Algebraic Stability of Persistence.”10.1145/2582112.2582168__Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.

Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.”10.1145/2582112.2582169__Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73, doi:10.1145/2582112.2582169.

Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of cech and Delaunay Filtrations.”10.1145/2582112.2582167__Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.

Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of Betti Numbers Reductions from Matrix Rank.”10.1137/1.9781611973402.11__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.

cadek, Martin, et al. “Computing All Maps into a Sphere.”10.1145/2597629__Journal of the ACM, vol. 61, no. 3, 17, ACM, 2014, doi:10.1145/2597629.

Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:10.4171/120-1/3.

Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”10.1007/978-3-319-13075-0_10__25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.

Edelsbrunner, Herbert. A Short Course in Computational Geometry and Topology. 1st ed., Springer Nature, 2014, doi:10.1007/978-3-319-05957-0.

Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.”10.1007/978-3-319-04099-8_16__Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16.

Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.”10.1007/978-3-319-04099-8_9__Topological Methods in Data Analysis and Visualization III., edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:10.1007/978-3-319-04099-8_9.

Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.”10.1007/s10851-013-0468-x__Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer, 2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.

Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.”10.1007/978-3-662-44199-2_24__ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.

Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.”10.48550/arXiv.1401.0468__ArXiv, 1401.0468, doi:10.48550/arXiv.1401.0468.

Biedl, Therese, et al. Recognizing Straight Skeletons and Voronoi Diagrams and Reconstructing Their Input. IEEE, 2013, pp. 37–46, doi:10.1109/ISVD.2013.11.

Biedl, Therese, et al. “Reconstructing Polygons from Embedded Straight Skeletons.” 29th European Workshop on Computational Geometry, TU Braunschweig, 2013, pp. 95–98.

Pausinger, Florian. “Van Der Corput Sequences and Linear Permutations.”10.1016/j.endm.2013.07.008__Electronic Notes in Discrete Mathematics, vol. 43, Elsevier, 2013, pp. 43–50, doi:10.1016/j.endm.2013.07.008.

cadek, Martin, et al. “Extending Continuous Maps: Polynomiality and Undecidability.”10.1145/2488608.2488683__45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604, doi:10.1145/2488608.2488683.

Attali, Dominique, et al. “Homological Reconstruction and Simplification in .”10.1145/2462356.2462373__Proceedings of the 29th Annual Symposium on Computational Geometry, ACM, 2013, pp. 117–25, doi:10.1145/2462356.2462373.

Topp, Christopher, et al. “D Phenotyping and Quantitative Trait Locus Mapping Identify Core Regions of the Rice Genome Controlling Root Architecture.”10.1073/pnas.1304354110__PNAS, vol. 110, no. 18, National Academy of Sciences, 2013, pp. 95–704, doi:10.1073/pnas.1304354110.

Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like Shapes.”10.1007/978-3-642-37067-0__17th IAPR International Conference on Discrete Geometry for Computer Imagery, vol. 7749, Springer, 2013, pp. XV–XIX, doi:10.1007/978-3-642-37067-0.

Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.”10.4310/HHA.2013.v15.n1.a3__Homology, Homotopy and Applications, vol. 15, no. 1, International Press, 2013, pp. 51–72, doi:10.4310/HHA.2013.v15.n1.a3.

Fang, Suqin, et al. “Genotypic Recognition and Spatial Responses by Rice Roots.”10.1073/pnas.1222821110__PNAS, vol. 110, no. 7, National Academy of Sciences, 2013, pp. 2670–75, doi:10.1073/pnas.1222821110.

Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. Vol. 31, JMLR, 2013, pp. 161–69.

Kerber, Michael, and Herbert Edelsbrunner. “D Kinetic Alpha Complexes and Their Implementation.”10.1137/1.9781611972931.6__2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society of Industrial and Applied Mathematics, 2013, pp. 70–77, doi:10.1137/1.9781611972931.6.

Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”10.1007/s00454-013-9517-x__Discrete &; Computational Geometry, vol. 49, no. 4, Springer, 2013, pp. 797–822, doi:10.1007/s00454-013-9517-x.

Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology.”10.1016/j.comgeo.2012.02.010__Computational Geometry: Theory and Applications, vol. 46, no. 4, Elsevier, 2013, pp. 435–47, doi:10.1016/j.comgeo.2012.02.010.

Edelsbrunner, Herbert. “Persistent Homology in Image Processing.”10.1007/978-3-642-38221-5_19__Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.

Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space of Steiner Minimal Trees.”10.1070/RM2012v067n06ABEH004820__Russian Mathematical Surveys, vol. 67, no. 6, IOP Publishing Ltd., 2012, pp. 1167–68, doi:10.1070/RM2012v067n06ABEH004820.

Edelsbrunner, Herbert, and Olga Symonova. The Adaptive Topology of a Digital Image. IEEE, 2012, pp. 41–48, doi:10.1109/ISVD.2012.11.

Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.”10.1070/RM2012v067n04ABEH004807__Russian Mathematical Surveys, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:10.1070/RM2012v067n04ABEH004807.

Zankl, Georg, et al. Interactive Labeling of Image Segmentation Hierarchies. Vol. 7476, Springer, 2012, pp. 11–20, doi:10.1007/978-3-642-32717-9_2.

Brown, Gavin, et al. “Fano 3 Folds in Codimension 4 Tom and Jerry Part I.”10.1112/S0010437X11007226__Compositio Mathematica, vol. 148, no. 4, Cambridge University Press, 2012, pp. 1171–94, doi:10.1112/S0010437X11007226.

Edelsbrunner, Herbert, and Michael Kerber. “Alexander Duality for Functions: The Persistent Behavior of Land and Water and Shore.”10.1145/2261250.2261287__Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–58, doi:10.1145/2261250.2261287.

Edelsbrunner, Herbert, et al. “Add Isotropic Gaussian Kernels at Own Risk: More and More Resilient Modes in Higher Dimensions.”10.1145/2261250.2261265__Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 91–100, doi:10.1145/2261250.2261265.

Edelsbrunner, Herbert, and Michael Kerber. “Dual Complexes of Cubical Subdivisions of dn.”10.1007/s00454-011-9382-4__Discrete &; Computational Geometry, vol. 47, no. 2, Springer, 2012, pp. 393–414, doi:10.1007/s00454-011-9382-4.

Ion, Adrian, et al. Image Segmentation by Figure-Ground Composition into Maximal Cliques. 6126486, IEEE, 2012, doi:10.1109/ICCV.2011.6126486.

Berberich, Eric, et al. “Deconstructing Approximate Offsets.”10.1007/s00454-012-9441-5__Discrete &; Computational Geometry, vol. 48, no. 4, Springer, 2012, pp. 964–89, doi:10.1007/s00454-012-9441-5.

Kerber, Michael, and Michael Sagraloff. “A Worst Case Bound for Topology Computation of Algebraic Curves.”10.1016/j.jsc.2011.11.001__10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation, vol. 47, no. 3, Elsevier, 2012, pp. 239–58, doi:10.1016/j.jsc.2011.11.001.

Busaryev, Oleksiy, et al. Annotating Simplices with a Homology Basis and Its Applications. Vol. 7357, Springer, 2012, pp. 189–200, doi:10.1007/978-3-642-31155-0_17.

Mileyko, Yuriy, et al. “Hierarchical Ordering of Reticular Networks.”10.1371/journal.pone.0036715__PLoS One, vol. 7, no. 6, e36715, Public Library of Science, 2012, doi:10.1371/journal.pone.0036715.

Bendich, Paul, et al. “A Point Calculus for Interlevel Set Homology.”10.1016/j.patrec.2011.10.007__Pattern Recognition Letters, vol. 33, no. 11, Elsevier, 2012, pp. 1436–44, doi:10.1016/j.patrec.2011.10.007.

Pausinger, Florian. “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, 2012, pp. 63–78.

Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.”10.4213/rm9503__Russian Mathematical Surveys, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:10.4213/rm9503.

Quadrianto, Novi, et al. “The Most Persistent Soft-Clique in a Set of Sampled Graphs.” Proceedings of the 29th International Conference on Machine Learning, ML Research Press, 2012, pp. 211–18.

Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.”10.5802/jtnb.819__Journal de Theorie Des Nombres Des Bordeaux, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:10.5802/jtnb.819.