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.




277 Publications

2014 | Published | Conference Paper | IST-REx-ID: 10894
U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.
View | Files available | DOI
 
2014 | Published | Conference Paper | IST-REx-ID: 2905 | OA
H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.
[Submitted Version] View | Files available | DOI
 
2014 | Published | Journal Article | IST-REx-ID: 1816 | OA
S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” International Journal of Computational Geometry and Applications, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.
[Published Version] View | Files available | DOI
 
2014 | Published | Journal Article | IST-REx-ID: 1842 | OA
J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete & Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2014 | Published | 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 | Published | 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 | Published | 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 | Submitted | Preprint | IST-REx-ID: 2012 | OA
M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” arXiv. .
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
2014 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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.)
 
2014 | Published | Book | IST-REx-ID: 6853
H. Edelsbrunner, A Short Course in Computational Geometry and Topology, 1st ed. Cham: Springer Nature, 2014.
View | Files available | DOI
 
2014 | Published | Journal Article | IST-REx-ID: 2255 | OA
H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,” Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp. 164–177, 2014.
[Submitted Version] View | Files available | DOI
 
2013 | Published | Conference Paper | IST-REx-ID: 10897
H. Edelsbrunner, “Persistent homology in image processing,” in Graph-Based Representations in Pattern Recognition, Vienna, Austria, 2013, vol. 7877, pp. 182–183.
View | DOI
 
2013 | Published | Journal Article | IST-REx-ID: 2304
F. Pausinger, “Van der Corput sequences and linear permutations,” Electronic Notes in Discrete Mathematics, vol. 43. Elsevier, pp. 43–50, 2013.
View | DOI
 
2013 | Published | Conference Paper | IST-REx-ID: 2807 | OA
M. Čadek, M. Krcál, J. Matoušek, L. Vokřínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed