MiniCV

I am professor at Graz University of Technology at the Institute of Geometry since 2015.
Before that, I had postdoc positions at Max Planck Institute for Informatics, Saarbrücken,
Stanford University, and the Institute of Science and Technology Austria.
I graduated in 2009 at Max Planck Institute for Informatics under the supervision of Kurt Mehlhorn and Michael Sagraloff.

Research interests

My research focuses on the design, analysis and implementation of efficient algorithms in algebraic topology, computational geometry, real algebraic geometry, and symbolic computation, with the goal to bridge the gap between mathematical theory and application areas. My current emphasis lies on the theory of persistent homology and its applications in the analysis of scientific data.

Selected Publications

for a complete list, click here
 Havard Bjerkevik, Magnus Botnan, Michael Kerber: Computing the interleaving distance is NPhard. Foundations of Computational Mathematics 20, pp.12371271, 2020.
 Aruni Choudhary, Michael Kerber, Sharath Raghvendra: Improved Topological Approximations by Digitization. Symposium on Discrete Algorithms (SODA 2019).
 Michael Kerber, Dmitriy Morozov, Arnur Nigmetov: Geometry helps to Compare Persistence Diagrams. Journal of Experimental Algorithms 22, 2017.
 Ulrich Bauer, Michael Kerber, Jan Reininghaus: Distributed Computation of Persistent Homology. Algorithm Engineering and Experiments (ALENEX 2014), pp.3138.
 Chao Chen, Michael Kerber: An Output Sensitive Algorithm for Persistent Homology. Computational Geometry: Theory and Applications 46 (4) pp. 435447, 2013  Special Issue on the 27th Annual Symposium on Computational Geometry.
 Paul Bendich, Herbert Edelsbrunner, Michael Kerber: Computing Robustness and Persistence for Images. IEEE Transactions on Visualization and Computer Graphics 16 (2010), pp. 12511260.
 Arno Eigenwillig, Michael Kerber, Nicola Wolpert: Fast and Exact Geometric Analysis of Real Algebraic Plane Curves. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC 2007), pp. 151158.

PhD Students

I had/have the privilege to be cosupervised by the following people in their PhD project (pardon the categorical joke):

Software

 PHAT is collection of efficient implementations of persistent homology
 DIPHA is another package for the efficient computation of persistent homology on distributed systems
 HERA is an efficient implementation for computing bottleneck and Wasserstein distances of persistence diagrams.
 SOPHIA is an efficient implementations for computing persistence diagrams of simplicial complexes connected by simplicial maps.
 mpfree computes the minimal presentation of a free implicit representation.
 Also check out the CGAL webpage, especially the algebraic kernel package

Other

Article (in German) about our research group (from 2020).

Teaching

see
here
