Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

264 Publications


2014 | Book Chapter | IST-REx-ID: 2044 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2153 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2156 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2155 | OA
U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,” in Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, 2014, pp. 484–490.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2177
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.
View | DOI
 

Filters and Search Terms

department=HeEd

Search

Filter Publications