Daniel Neuen

activity

20212026

most citedIsomorphism Testing Parameterized by Genus and Beyond

4 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2024Show all

3 papers · 1 filter

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…

cs.DS2024

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.CC2024

Counting Small Induced Subgraphs: Hardness via Fourier Analysis

Radu Curticapean, Daniel Neuen

For a fixed graph property $Φ$ and integer $k \geq 1$ , consider the problem of counting the induced $k$ -vertex subgraphs satisfying $Φ$ in an input graph $G$ . This problem can be s…