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
2011 | Conference Paper | IST-REx-ID: 3329 | 
Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | Journal Article | IST-REx-ID: 3332 |
Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3330 |
Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Conference Paper | IST-REx-ID: 3328 |
Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. https://doi.org/10.1145/1998196.1998224.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry. Springer, 2011. https://doi.org/10.1007/s00454-010-9313-9.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3367
Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology,” 207–16. ACM, 2011. https://doi.org/10.1145/1998196.1998228.
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3781
Fasy, Brittany Terese. “The Difference in Length of Curves in R^n.” Acta Sci. Math. (Szeged). Szegedi Tudományegyetem, 2011.
View
2011 | Book Chapter | IST-REx-ID: 3796 |
Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres by Diagonal Distortion in R^n.” In Rainbow of Computer Science, edited by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. https://doi.org/10.1007/978-3-642-19391-0_2.
[Submitted Version]
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3965
Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation Maxima by Searching the Gauss Sphere.” Journal of Experimental Algorithmics. ACM, 2011. https://doi.org/10.1145/1963190.1970375.
View
| DOI
2011 | Book Chapter | IST-REx-ID: 3271
Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of Persistent Homology for Cubical Data.” In Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert, Helwig Hauser, Hamish Carr, and Raphael Fuchs, 91–106. Springer, 2011. https://doi.org/10.1007/978-3-642-23175-9_7.
View
| DOI