In a recent work, Esmer et al. describe a simple method - Approximate
Mo...
The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple
combinat...
The goal of this paper is to understand how exponential-time approximati...
For a well-studied family of domination-type problems, in bounded-treewi...
Two graphs are homomorphism indistinguishable over a graph class
ℱ, deno...
We prove new upper and lower bounds on the number of iterations the
k-di...
A square coloring of a graph G is a coloring of the square G^2 of G,
tha...
We investigate how efficiently a well-studied family of domination-type
...
We generalize the monotone local search approach of Fomin, Gaspers,
Loks...
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that
co...
Subexponential parameterized algorithms are known for a wide range of na...
We present an isomorphism test for graphs of Euler genus g running in ti...
We give an isomorphism test that runs in time n^polylog(h)
on all n-vert...
We give an overview of recent advances on the graph isomorphism problem....
We prove that there is a graph isomorphism test running in time
n^polylo...
We consider the isomorphism problem for hypergraphs taking as input two
...
The Weisfeiler-Leman procedure is a widely-used approach for graph
isomo...
We prove that the combinatorial Weisfeiler-Leman algorithm of dimension
...
We give a new fpt algorithm testing isomorphism of n-vertex graphs of tr...
Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...
Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs...