Matthias Kaul

According to our database, Matthias Kaul authored at least 2 papers between 2023 and 2024.

Collaborative distances:

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

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

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