A (3/2 + ε)-Approximation for Multiple TSP with a Variable Number of Depots. - Max A. Deppert; Matthias Kaul; Matthias Mnich (ESA, 2023)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates. - Matthias Kaul; Matthias Mnich; Hendrik Molter (IPEC, 2024)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. - Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz 001 (ACM Trans. Algorithms, 2024)

Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously. - Matthias Kaul; Kelin Luo; Matthias Mnich; Heiko Röglin (STACS, 2025)