Matthias Kaul

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously	2025	Matthias Kaul Kelin Luo Matthias Mnich Heiko Röglin
+ PDF Chat	Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates	2024	Matthias Kaul Matthias Mnich Hendrik Molter
+ PDF Chat	Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter	2023	Parinya Chalermsook Matthias Kaul Matthias Mnich Joachim Spoerhase Sumedha Uniyal Daniel Vaz
+	A $(3/2 + \varepsilon)$-Approximation for Multiple TSP with a Variable Number of Depots	2023	Max A. Deppert Matthias Kaul Matthias Mnich
+	Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter	2021	Parinya Chalermsook Matthias Kaul Matthias Mnich Joachim Spoerhase Sumedha Uniyal Daniel Vaz

Common Coauthors

Coauthor	Papers Together
Matthias Mnich	5
Parinya Chalermsook	2
Daniel Vaz	2
Joachim Spoerhase	2
Sumedha Uniyal	2
Max A. Deppert	1
Hendrik Molter	1
Heiko Röglin	1
Kelin Luo	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	The complexity of finding uniform sparsest cuts in various graph classes	2011	Paul Bonsma Hajo Broersma Viresh Patel A. V. Pyatkin	2
+ PDF Chat	Pathwidth, trees, and random embeddings	2013	James R. Lee Anastasios Sidiropoulos	2
+ PDF Chat	Approximating Sparsest Cut in Graphs of Bounded Treewidth	2010	Eden Chlamtáč Robert Krauthgamer Prasad Raghavendra	2
+ PDF Chat	Expander flows, geometric embeddings and graph partitioning	2009	Sanjeev Arora Satish Rao Umesh Vazirani	2
+	Euclidean distortion and the sparsest cut	2007	Sanjeev Arora James Lee Assaf Naor	2
+ PDF Chat	A $c^k n$ 5-Approximation Algorithm for Treewidth	2016	Hans L. Bodlaender Pål Grønås Drange Markus Sortland Dregi Fedor V. Fomin Daniel Lokshtanov Michał Pilipczuk	2
+	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs	2018	Parinya Chalermsook Syamantak Das Guy Even Bundit Laekhanukit Daniel Vaz	2
+	Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results	2013	Anupam Gupta Kunal Talwar David Witmer	1
+	A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time	2021	Vincent Cohen-Addad Tobias Mömke Víctor Verdugo	1
+ PDF Chat	A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming	2003	Monique Laurent	1
+	A quasipolynomial (2 + <i>ε</i> )-approximation for planar sparsest cut	2021	Vincent Cohen-Addad Anupam Gupta Philip N. Klein Jason Li	1
+	A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.	2021	Vincent Cohen-Addad Tobias Mömke Víctor Verdugo	1
+	Polylogarithmic inapproximability	2003	Eran Halperin Robert Krauthgamer	1