Computing the multicover bifiltration
R. Corbet, M. Kerber, M. Lesnick, G.F. Osang, Discrete and Computational Geometry 70 (2023) 376–405.

3D kinetic alpha complexes and their implementation
M. Kerber, H. Edelsbrunner, in:, 2013 Proceedings of the 15th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2013, pp. 70–77.

An output sensitive algorithm for persistent homology
C. Chen, M. Kerber, Computational Geometry: Theory and Applications 46 (2013) 435–447.

Alexander duality for functions: The persistent behavior of land and water and shore
H. Edelsbrunner, M. Kerber, in:, Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry , ACM, 2012, pp. 249–258.

A worst case bound for topology computation of algebraic curves
M. Kerber, M. Sagraloff,  Journal of Symbolic Computation 47 (2012) 239–258.

Dual complexes of cubical subdivisions of dn
H. Edelsbrunner, M. Kerber, Discrete &; Computational Geometry 47 (2012) 393–414.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, Discrete &; Computational Geometry 48 (2012) 964–989.

Fano 3 folds in codimension 4 Tom and Jerry Part I
G. Brown, M. Kerber, M. Reid, Compositio Mathematica 148 (2012) 1171–1194.

Persistent homology computation with a twist
C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200.

A generic algebraic kernel for non linear geometric applications
E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.

Root refinement for real polynomials
M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.

Covering and packing with spheres by diagonal distortion in R^n
H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.), Rainbow of Computer Science, Springer, 2011, pp. 20–35.

An output sensitive algorithm for persistent homology
C. Chen, M. Kerber, in:, ACM, 2011, pp. 207–216.

Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196.

A note on the complexity of real algebraic hypersurfaces
M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.

Persistent homology under non-uniform error
P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.

Polygonal reconstruction from approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.

Computing robustness and persistence for images
P. Bendich, H. Edelsbrunner, M. Kerber, IEEE Transactions of Visualization and Computer Graphics 16 (2010) 1251–1260.