11 citations · 61 across the 16 of their papers we have counts for
19 papers
FPT Isomorphism Test for -Free Tournaments
Daniel Neuen
We show that isomorphism of -free tournaments can be solved in FPT time , where denotes the size of , and denotes the size of the input tournamen…
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
Anatole Dahan, Martin Grohe, Daniel Neuen +1
We present an additive -approximation algorithm for the Graph Edit Distance problem (GED) on graphs of VC dimension running in time $n^{O(d/\varepsilon^{2})}…
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables…
Isomorphism for Tournaments of Small Twin Width
Martin Grohe, Daniel Neuen
We prove that isomorphism of tournaments of twin width at most can be decided in time . This implies that the isomorphism problem for classes of tourname…
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
Martin Grohe, Moritz Lichter, Daniel Neuen +1
The -dimensional Weisfeiler-Leman (-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applic…
The Iteration Number of the Weisfeiler-Leman Algorithm
Martin Grohe, Moritz Lichter, Daniel Neuen
We prove new upper and lower bounds on the number of iterations the -dimensional Weisfeiler-Leman algorithm (-WL) requires until stabilization. For , we show that $…