2025

• Approximate minimum tree cover in all symmetric monotone norms simultaneously
  Kaul, Matthias; Luo, Kelin; Mnich, Matthias; Röglin, Heiko
  42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025
  Open Access | Publisher DOI
• Parameterized approximation algorithms for optimization problems on graphs
  Kaul, Matthias
  Technische Universität Hamburg (2025)
  Open Access

2024

• Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
  Kaul, Matthias; Mnich, Matthias; Molter, Hendrik
  19th International Symposium on Parameterized and Exact Computation, IPEC 2024
  Open Access | Publisher DOI
• Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
  Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel
  ACM Transactions in Algorithms 20 (1): 6 (2024)
  Publisher DOI

2023

• A (3/2 + ε)-Approximation for multiple TSP with a variable number of depots
  Deppert, Max; Kaul, Matthias; Mnich, Matthias
  31st Annual European Symposium on Algorithms, ESA 2023
  Open Access | Publisher DOI