Daniel Neuen

activity

20162026

most citedThe Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

11 citations · 61 across the 16 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DS2026

FPT Isomorphism Test for $F$ -Free Tournaments

Daniel Neuen

We show that isomorphism of $F$ -free tournaments can be solved in FPT time $f (k) \cdot n^{O (1)}$ , where $k$ denotes the size of $F$ , and $n$ denotes the size of the input tournamen…

cs.DS2026

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension

Anatole Dahan, Martin Grohe, Daniel Neuen +1

We present an additive $ε n^{2}$ -approximation algorithm for the Graph Edit Distance problem (GED) on graphs of VC dimension $d$ running in time $n^{O(d/\varepsilon^{2})}…

FPT Isomorphism Test for F-Free Tournaments

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension

FPT Isomorphism Test for $F$ -Free Tournaments