Pausinger, F., &; Steinerberger, S. (2015). On the distribution of local extrema in quantum chaos. Physics Letters, Section A. Elsevier.https://doi.org/10.1016/j.physleta.2014.12.010 

Edelsbrunner, H., Jablonski, G., &; Mrozek, M. (2015). The persistent homology of a self-map. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-014-9223-y 

Attali, D., Bauer, U., Devillers, O., Glisse, M., &; Lieutier, A. (2015). Homological reconstruction and simplification in . Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2014.08.010 

Symonova, O., Topp, C., &; Edelsbrunner, H. (2015). DynamicRoots: A software platform for the reconstruction and analysis of growing plant roots. PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0127657 

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

Pausinger, F., &; Svane, A. (2015). A Koksma-Hlawka inequality for general discrepancy systems. Journal of Complexity. Academic Press.https://doi.org/10.1016/j.jco.2015.06.002 

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 P.-T. Bremer, I. Hotz, V. Pascucci, &; R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III  (Vol. 1, pp. 55–69). Cham: Springer.https://doi.org/10.1007/978-3-319-04099-8_4 

Huber, S., Held, M., Meerwald, P., &; Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. World Scientific Publishing.https://doi.org/10.1142/S0218195914500034 

Cibulka, J., Gao, P., Krcál, M., Valla, T., &; Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-014-9646-x 

Dolbilin, N., Edelsbrunner, H., Glazyrin, A., &; Musin, O. (2014). Functionals on triangulations of delaunay sets. Moscow Mathematical Journal. Independent University of Moscow.https://doi.org/10.17323/1609-4514-2014-14-3-491-504 

Alexeev, V. V., Bogaevskaya, V. G., Preobrazhenskaya, M. M., Ukhalov, A. Y., Edelsbrunner, H., &; Yakimova, O. (2014). An algorithm for cartographic generalization that preserves global topology. Journal of Mathematical Sciences. Springer.https://doi.org/10.1007/s10958-014-2165-8 

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. IEEE.https://doi.org/10.1109/TVCG.2014.2346432 

Bauer, U., Kerber, M., &; Reininghaus, J. (2014). Distributed computation of persistent homology. In C.https://doi.org/10.1137/1.9781611973198.4__McGeoch &; U. Meyer (Eds.), Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 31–38). Portland, USA: Society of Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973198.4 

Bauer, U., Kerber, M., &; Reininghaus, J. (2014). Clear and Compress: Computing Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, &; R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (pp. 103–117). Springer.https://doi.org/10.1007/978-3-319-04099-8_7 

Bauer, U., &; Lesnick, M. (2014). Induced matchings of barcodes and the algebraic stability of persistence. In Proceedings of the Annual Symposium on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582168 

Bauer, U., Ge, X., &; Wang, Y. (2014). Measuring distance between Reeb graphs. In Proceedings of the Annual Symposium on Computational Geometry (pp. 464–473). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582169 

Bauer, U., &; Edelsbrunner, H. (2014). The morse theory of cech and Delaunay filtrations. In Proceedings of the Annual Symposium on Computational Geometry (pp. 484–490). Kyoto, Japan: ACM.https://doi.org/10.1145/2582112.2582167 

Edelsbrunner, H., &; Parsa, S. (2014). On the computational complexity of betti numbers reductions from matrix rank. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM.https://doi.org/10.1137/1.9781611973402.11 

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. ACM.https://doi.org/10.1145/2597629