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.
LibreCat: https://research-explorer.ista.ac.at/record/1876
DOI: 10.17323/1609-4514-2014-14-3-491-504
arXiv: 1211.7053

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.
LibreCat: https://research-explorer.ista.ac.at/record/1929
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.
LibreCat: https://research-explorer.ista.ac.at/record/1930
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.
LibreCat: https://research-explorer.ista.ac.at/record/2043
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.
LibreCat: https://research-explorer.ista.ac.at/record/2044
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.
LibreCat: https://research-explorer.ista.ac.at/record/2153
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.
LibreCat: https://research-explorer.ista.ac.at/record/2156
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.
LibreCat: https://research-explorer.ista.ac.at/record/2155
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.
LibreCat: https://research-explorer.ista.ac.at/record/2177
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.
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629