Daniel Neuen

activity

20242026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search

BarÄ±Å Can Esmer, Ariel Kulik, DÃ¡niel Marx +2

We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and expon…

cs.DS2025

Can You Link Up With Treewidth?

Radu Curticapean, Simon DÃ¶ring, Daniel Neuen +1

In a fundamental paper in parameterized complexity theory, Marx [ToC '10] constructed $k$ -vertex graphs $H$ of maximum degree $3$ such that $n^{o (k / l o g k)}$ time algorithms for d…

cs.DS2024

Robust Contraction Decomposition for Minor-Free Graphs and its Applications

Sayan Bandyapadhyay, William Lochet, Daniel Lokshtanov +6

We prove a robust contraction decomposition theorem for $H$ -minor-free graphs, which states that given an $H$ -minor-free graph $G$ and an integer $p$ , one can partition in polynomi…