Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
209 Publications
2014 | Book Chapter | IST-REx-ID: 2044 | 
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
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2153 |
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
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2155 |
Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech 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
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2156 |
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
View
| DOI
| Download Submitted Version (ext.)
2014 | Conference Paper | IST-REx-ID: 2177
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
View
| DOI