Matthias Kaul

Me

I am a theoretical computer scientist currently at the University of Bonn with László Végh. Previously I was at the Institute for Algorithms and Complexity with the Hamburg University of Technology.

My research is focused on Parameterized and Approximation Algorithms and Discrete Mathematics.

You can contact me at mkaul@uni-bonn.de

Publications

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously

With Kelin Luo, Matthias Mnich, and Heiko Röglin

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates

With Matthias Mnich and Hendrik Molter

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

With Parinya Chalermsook, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, and Daniel Vaz


A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots 

With Max A. Deppert and Matthias Mnich

Teaching

Hamburg

Bonn