Matthias Kaul

According to our database, Matthias Kaul authored at least 4 papers between 2023 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2025

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously.

Matthias Kaul, Kelin Luo, Matthias Mnich, Heiko Röglin

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter.

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz

ACM Trans. Algorithms, January, 2024

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

Matthias Kaul, Matthias Mnich, Hendrik Molter

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

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

Max Deppert, Matthias Kaul, Matthias Mnich

Proceedings of the 31st Annual European Symposium on Algorithms, 2023