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 | OA
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
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2011 | Journal Article | IST-REx-ID: 3332 | OA
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
[Submitted Version] View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3330 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3328 | OA
Berberich, E., Hemmer, M., & Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998224
[Published Version] View | DOI | Download Published Version (ext.)
 
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 | 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: 3781
Fasy, B. T. (2011). The difference in length of curves in R^n. Acta Sci. Math. (Szeged). Szegedi Tudományegyetem.
View
 
2011 | Book Chapter | IST-REx-ID: 3796 | OA
Edelsbrunner, H., & Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, & A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer. 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, B., Edelsbrunner, H., & Morozov, D. (2011). Computing elevation maxima by searching the Gauss sphere. Journal of Experimental Algorithmics. ACM. https://doi.org/10.1145/1963190.1970375
View | DOI
 
2011 | Book Chapter | IST-REx-ID: 3271
Wagner, H., Chen, C., & Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, & R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 91–106). Springer. https://doi.org/10.1007/978-3-642-23175-9_7
View | DOI
 

Search

Filter Publications