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.
292 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3336
Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 2089–2096.
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3781
Fasy BT. 2011. The difference in length of curves in R^n. Acta Sci. Math. (Szeged). 77(1–2), 359–367.
View
2011 | Published | Book Chapter | IST-REx-ID: 3796 |
Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 9648 |
Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental algorithm for computing AT-models and persistent homology. Computer Analysis of Images and Patterns. CAIP: International Conference on Computer Analysis of Images and Patterns, LNCS, vol. 6854, 286–293.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3367
Chen C, Kerber M. 2011. An output sensitive algorithm for persistent homology. SoCG: Symposium on Computational Geometry, 207–216.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3329 |
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 187–196.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3377 |
Edelsbrunner H, Morozov D, Patel A. 2011. Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. 11(3), 345–361.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3332 |
Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430.
[Submitted Version]
View
| Files available
| DOI
| WoS
2011 | Published | Journal Article | IST-REx-ID: 3269 |
Sheng Y, Cutler B, Chen C, Nasman J. 2011. Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. 30(4), 1261–1268.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
2011 | Published | Journal Article | IST-REx-ID: 3267
Chen C, Freedman D. 2011. Hardness results for homology localization. Discrete & Computational Geometry. 45(3), 425–448.
View
| Files available
| DOI
| WoS
2010 | Published | Book Chapter | IST-REx-ID: 3795 |
Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3849 |
Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 3850
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.
View
2010 | Published | Conference Paper | IST-REx-ID: 3853 |
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
[Submitted Version]
View
| Files available
| DOI
2010 | Published | Conference Paper | IST-REx-ID: 10909
Chen C, Freedman D. 2010. Hardness results for homology localization. Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1594–1604.
View
| Files available
| DOI