Corbet, R., Kerber, M., Lesnick, M., &; Osang, G. F. (2023). Computing the multicover bifiltration. Discrete and Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-022-00476-8 
LibreCat: https://research-explorer.ista.ac.at/record/12709
DOI: 10.1007/s00454-022-00476-8
WoS: 000936496800001
arXiv: 2103.07823

Kerber, M., &; Edelsbrunner, H. (2013). 3D kinetic alpha complexes and their implementation. In 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments (pp. 70–77). New Orleans, LA, United States: Society of Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611972931.6 
LibreCat: https://research-explorer.ista.ac.at/record/2906
DOI: 10.1137/1.9781611972931.6

Chen, C., &; Kerber, M. (2013). An output sensitive algorithm for persistent homology. Computational Geometry: Theory and Applications. Elsevier.https://doi.org/10.1016/j.comgeo.2012.02.010 
LibreCat: https://research-explorer.ista.ac.at/record/2939
DOI: 10.1016/j.comgeo.2012.02.010

Brown, G., Kerber, M., &; Reid, M. (2012). Fano 3 folds in codimension 4 Tom and Jerry Part I. Compositio Mathematica. Cambridge University Press.https://doi.org/10.1112/S0010437X11007226 
LibreCat: https://research-explorer.ista.ac.at/record/3120
DOI: 10.1112/S0010437X11007226

Edelsbrunner, H., &; Kerber, M. (2012). Alexander duality for functions: The persistent behavior of land and water and shore. In Proceedings of the twenty-eighth annual symposium on Computational geometry  (pp. 249–258). Chapel Hill, NC, USA: ACM.https://doi.org/10.1145/2261250.2261287 
LibreCat: https://research-explorer.ista.ac.at/record/3133
DOI: 10.1145/2261250.2261287

Edelsbrunner, H., &; Kerber, M. (2012). Dual complexes of cubical subdivisions of dn. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-011-9382-4 
LibreCat: https://research-explorer.ista.ac.at/record/3256
DOI: 10.1007/s00454-011-9382-4

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2012). Deconstructing approximate offsets. Discrete &; Computational Geometry. Springer.https://doi.org/10.1007/s00454-012-9441-5 
LibreCat: https://research-explorer.ista.ac.at/record/3115
DOI: 10.1007/s00454-012-9441-5
arXiv: 1109.2158

Kerber, M., &; Sagraloff, M. (2012). A worst case bound for topology computation of algebraic curves. https://doi.org/10.1016/j.jsc.2011.11.001__Journal of Symbolic Computation. Elsevier.https://doi.org/10.1016/j.jsc.2011.11.001 
LibreCat: https://research-explorer.ista.ac.at/record/3331
DOI: 10.1016/j.jsc.2011.11.001

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 
LibreCat: https://research-explorer.ista.ac.at/record/3329
DOI: 10.1145/1998196.1998225

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 
LibreCat: https://research-explorer.ista.ac.at/record/3332
DOI: 10.1007/s00373-011-1020-7

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 
LibreCat: https://research-explorer.ista.ac.at/record/3330
DOI: 10.1145/1993886.1993920
arXiv: 1104.1362

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 
LibreCat: https://research-explorer.ista.ac.at/record/3328
DOI: 10.1145/1998196.1998224

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 
LibreCat: https://research-explorer.ista.ac.at/record/3367
DOI: 10.1145/1998196.1998228

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 
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

Chen, C., &; Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Bendich, P., Edelsbrunner, H., Kerber, M., &; Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_2 
LibreCat: https://research-explorer.ista.ac.at/record/3849
DOI: 10.1007/978-3-642-15155-2_2

Berberich, E., Halperin, D., Kerber, M., &; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.
LibreCat: https://research-explorer.ista.ac.at/record/3850

Bendich, P., Edelsbrunner, H., &; Kerber, M. (2010). Computing robustness and persistence for images. IEEE Transactions of Visualization and Computer Graphics. IEEE.https://doi.org/10.1109/TVCG.2010.139 
LibreCat: https://research-explorer.ista.ac.at/record/3901
DOI: 10.1109/TVCG.2010.139