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.
224 Publications
2011 | Conference Paper | IST-REx-ID: 3329 | 
Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | Conference Paper | IST-REx-ID: 3330 |
Kerber, M., & Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer. https://doi.org/10.1145/1993886.1993920
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3332 |
Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9
View
| DOI
2011 | Book Chapter | IST-REx-ID: 3335 |
Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C., … Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, & M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer. https://doi.org/10.1007/978-3-642-25249-5_3
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Conference Paper | IST-REx-ID: 3367
Chen, C., & Kerber, M. (2011). An output sensitive algorithm for persistent homology (pp. 207–216). Presented at the SoCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998228
View
| Files available
| DOI
2011 | 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. Springer. https://doi.org/10.1007/s10208-011-9090-8
View
| DOI
| Download Submitted Version (ext.)
2011 | Journal Article | IST-REx-ID: 3378
Bendich, P., & Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-010-9081-1
View
| DOI
2011 | Conference Paper | IST-REx-ID: 9648 |
Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., & Poyatos, R. (2011). Incremental-decremental algorithm for computing AT-models and persistent homology. In Computer Analysis of Images and Patterns (Vol. 6854, pp. 286–293). Seville, Spain: Springer Nature. https://doi.org/10.1007/978-3-642-23672-3_35
View
| DOI
| Download Published Version (ext.)
2011 | Journal Article | IST-REx-ID: 3781
Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Sci. Math. (Szeged). Szegedi Tudományegyetem.
View