2024

• 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 (2024)
  Publisher DOI

2023

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

2021

• Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
  Chalermsook, Parinya; Kaul, Matthias; Mnich, Matthias; Spoerhase, Joachim; Uniyal, Sumedha; Vaz, Daniel
  arXiv: 2111.06299 (2021)
  Open Access