Michael Kerber

Edelsbrunner Group

18 Publications

Mark all

[18]
2023 | Journal Article | IST-REx-ID: 12709 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[17]
2013 | Conference Paper | IST-REx-ID: 2906 | OA
Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.
[Submitted Version] View | Files available | DOI
 
[16]
2013 | Journal Article | IST-REx-ID: 2939
Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447.
View | Files available | DOI
 
[15]
2012 | Journal Article | IST-REx-ID: 3120 | OA
Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194.
[Preprint] View | DOI | Download Preprint (ext.)
 
[14]
2012 | Conference Paper | IST-REx-ID: 3133 | OA
Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.
[Preprint] View | DOI | Download Preprint (ext.)
 
[13]
2012 | Journal Article | IST-REx-ID: 3256 | OA
Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414.
[Submitted Version] View | Files available | DOI
 
[12]
2012 | Journal Article | IST-REx-ID: 3115 | OA
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete & Computational Geometry. 48(4), 964–989.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2012 | Journal Article | IST-REx-ID: 3331 | OA
Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.
[Preprint] View | DOI | Download Preprint (ext.)
 
[10]
2011 | Conference Paper | IST-REx-ID: 3329 | OA
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.)
 
[9]
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. 27(3), 419–430.
[Submitted Version] View | Files available | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 3330 | OA
Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2011 | Conference Paper | IST-REx-ID: 3328 | OA
Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.
[Published Version] View | DOI | Download Published Version (ext.)
 
[6]
2011 | 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
 
[5]
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: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
[Submitted Version] View | Files available | DOI
 
[4]
2011 | Conference Paper | IST-REx-ID: 3270
Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.
View
 
[3]
2010 | Conference Paper | IST-REx-ID: 3849 | OA
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
 
[2]
2010 | 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
 
[1]
2010 | Journal Article | IST-REx-ID: 3901 | OA
Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

18 Publications

Mark all

[18]
2023 | Journal Article | IST-REx-ID: 12709 | OA
Corbet R, Kerber M, Lesnick M, Osang GF. 2023. Computing the multicover bifiltration. Discrete and Computational Geometry. 70, 376–405.
[Published Version] View | Files available | DOI | WoS | arXiv
 
[17]
2013 | Conference Paper | IST-REx-ID: 2906 | OA
Kerber M, Edelsbrunner H. 2013. 3D kinetic alpha complexes and their implementation. 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments. ALENEX: Algorithm Engineering and Experiments, ALENEX, , 70–77.
[Submitted Version] View | Files available | DOI
 
[16]
2013 | Journal Article | IST-REx-ID: 2939
Chen C, Kerber M. 2013. An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. 46(4), 435–447.
View | Files available | DOI
 
[15]
2012 | Journal Article | IST-REx-ID: 3120 | OA
Brown G, Kerber M, Reid M. 2012. Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. 148(4), 1171–1194.
[Preprint] View | DOI | Download Preprint (ext.)
 
[14]
2012 | Conference Paper | IST-REx-ID: 3133 | OA
Edelsbrunner H, Kerber M. 2012. Alexander duality for functions: The persistent behavior of land and water and shore. Proceedings of the twenty-eighth annual symposium on Computational geometry . SCG: Symposium on Computational Geometry, 249–258.
[Preprint] View | DOI | Download Preprint (ext.)
 
[13]
2012 | Journal Article | IST-REx-ID: 3256 | OA
Edelsbrunner H, Kerber M. 2012. Dual complexes of cubical subdivisions of ℝn. Discrete & Computational Geometry. 47(2), 393–414.
[Submitted Version] View | Files available | DOI
 
[12]
2012 | Journal Article | IST-REx-ID: 3115 | OA
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2012. Deconstructing approximate offsets. Discrete & Computational Geometry. 48(4), 964–989.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2012 | Journal Article | IST-REx-ID: 3331 | OA
Kerber M, Sagraloff M. 2012. A worst case bound for topology computation of algebraic curves. Journal of Symbolic Computation. 47(3), 239–258.
[Preprint] View | DOI | Download Preprint (ext.)
 
[10]
2011 | Conference Paper | IST-REx-ID: 3329 | OA
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.)
 
[9]
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. 27(3), 419–430.
[Submitted Version] View | Files available | DOI
 
[8]
2011 | Conference Paper | IST-REx-ID: 3330 | OA
Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation, 209–216.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2011 | Conference Paper | IST-REx-ID: 3328 | OA
Berberich E, Hemmer M, Kerber M. 2011. A generic algebraic kernel for non linear geometric applications. SCG: Symposium on Computational Geometry, 179–186.
[Published Version] View | DOI | Download Published Version (ext.)
 
[6]
2011 | 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
 
[5]
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: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.
[Submitted Version] View | Files available | DOI
 
[4]
2011 | Conference Paper | IST-REx-ID: 3270
Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.
View
 
[3]
2010 | Conference Paper | IST-REx-ID: 3849 | OA
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
 
[2]
2010 | 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
 
[1]
2010 | Journal Article | IST-REx-ID: 3901 | OA
Bendich P, Edelsbrunner H, Kerber M. 2010. Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. 16(6), 1251–1260.
[Submitted Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed