The k-dimensional Weisfeiler-Leman (k-WL) algorithm is a simple
combinat...
We study the online graph exploration problem proposed by Kalyanasundara...
Dedicated treatment of symmetries in satisfiability problems (SAT) is
in...
State-of-the-art solvers for symmetry detection in combinatorial objects...
We extend Choiceless Polynomial Time (CPT), the currently only remaining...
Message passing neural networks (MPNN) have provable limitations, which ...
We investigate the relationship between various isomorphism invariants f...
Individualization-Refinement (IR) algorithms form the standard method an...
In practice symmetries of combinatorial structures are computed by
trans...
Color refinement is a crucial subroutine in symmetry detection in theory...
This paper considers the length of resolution proofs when using
Krishnam...
We determine the structure of automorphism groups of finite graphs of bo...
We engineer a new probabilistic Monte-Carlo algorithm for isomorphism
te...
We define a search problem on trees that closely captures the backtracki...
In the quest for a logic capturing PTime the next natural classes of
str...
In comparison to graphs, combinatorial methods for the isomorphism probl...
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
We show that the 2-dimensional Weisfeiler-Leman algorithm stabilizes n-v...
We devise a unified framework for the design of canonization algorithms....
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...
Given a sequence of integers, we want to find a longest increasing
subse...
We prove that the Weisfeiler-Leman (WL) dimension of the class of all fi...