Get started
Author

Matthias Kaul

Observed name: Kaul, Matthias
ORCID: 0000-0003-0124-0789
Observed ORCID: 0000-0003-0124-0789
OpenAlex ID: A5078092425
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter
2023 · Parinya Chalermsook, Matthias Kaul, et al. · ACM Transactions on Algorithms · 1
PDF
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
2025 · Kaul, Matthias, Luo, Kelin, et al. · arXiv (Cornell University)
PDF
Parameterisierte Approximationsalgorithmen für Optimierungsprobleme auf Graphen
2025 · Kaul, Matthias · Gesellschaft für Informatik (GI)
Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
2024 · Kaul, Matthias, Mnich, Matthias, et al. · arXiv (Cornell University)
PDF
A $(3/2 + \varepsilon)$-Approximation for Multiple TSP with a Variable Number of Depots
2023 · Deppert, Max, Kaul, Matthias, et al. · arXiv (Cornell University)
PDF
Works count: 9
Citation count: 2
H-index: 1
I10-index:
Year
Topic
Type