N. Dolbilin, H. Edelsbrunner, A. Glazyrin, and O. Musin, “Functionals on triangulations of delaunay sets,” Moscow Mathematical Journal, vol. 14, no. 3. Independent University of Moscow, pp. 491–504, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1876
DOI: 10.17323/1609-4514-2014-14-3-491-504
arXiv: 1211.7053

V. V. Alexeev, V. G. Bogaevskaya, M. M. Preobrazhenskaya, A. Y. Ukhalov, H. Edelsbrunner, and O. Yakimova, “An algorithm for cartographic generalization that preserves global topology,” Journal of Mathematical Sciences, vol. 203, no. 6. Springer, pp. 754–760, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1929
DOI: 10.1007/s10958-014-2165-8

D. Günther, A. Jacobson, J. Reininghaus, H. Seidel, O. Sorkine Hornung, and T. Weinkauf, “Fast and memory-efficient topological denoising of 2D and 3D scalar fields,” IEEE Transactions on Visualization and Computer Graphics, vol. 20, no. 12. IEEE, pp. 2585–2594, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1930
DOI: 10.1109/TVCG.2014.2346432

U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent homology,” in Proceedings of the Workshop on Algorithm Engineering and Experiments, Portland, USA, 2014, pp. 31–38.
LibreCat: https://research-explorer.ista.ac.at/record/2043
DOI: 10.1137/1.9781611973198.4

U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent Homology in Chunks,” in Topological Methods in Data Analysis and Visualization III, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Springer, 2014, pp. 103–117.
LibreCat: https://research-explorer.ista.ac.at/record/2044
DOI: 10.1007/978-3-319-04099-8_7

U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic stability of persistence,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 355–364.
LibreCat: https://research-explorer.ista.ac.at/record/2153
DOI: 10.1145/2582112.2582168

U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 464–473.
LibreCat: https://research-explorer.ista.ac.at/record/2156
DOI: 10.1145/2582112.2582169

U. Bauer and H. Edelsbrunner, “The morse theory of cech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490.
LibreCat: https://research-explorer.ista.ac.at/record/2155
DOI: 10.1145/2582112.2582167

H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.
LibreCat: https://research-explorer.ista.ac.at/record/2177
DOI: 10.1137/1.9781611973402.11

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2184
DOI: 10.1145/2597629