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.




263 Publications

2014 | Journal Article | IST-REx-ID: 1876 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
2014 | Journal Article | IST-REx-ID: 1929
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.
View | DOI
 
2014 | Journal Article | IST-REx-ID: 1930
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.
View | DOI
 
2014 | Conference Paper | IST-REx-ID: 2043 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
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
 
2014 | Journal Article | IST-REx-ID: 2184 | OA
M. Čadek, M. Krcál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Preprint] View | DOI | Download Preprint (ext.)
 

Search

Filter Publications