
Comparative DesignChoice Analysis of Color Refinement Algorithms Beyond the Worst Case
Color refinement is a crucial subroutine in symmetry detection in theory...
read it

Resolution with Symmetry Rule applied to Linear Equations
This paper considers the length of resolution proofs when using Krishnam...
read it

Automorphism groups of graphs of bounded Hadwiger number
We determine the structure of automorphism groups of finite graphs of bo...
read it

Engineering a Fast Probabilistic Isomorphism Test
We engineer a new probabilistic MonteCarlo algorithm for isomorphism te...
read it

Search Problems in Trees with Symmetries: near optimal traversal strategies for individualizationrefinement algorithms
We define a search problem on trees that closely captures the backtracki...
read it

Canonization for Bounded and Dihedral Color Classes in Choiceless Polynomial Time
In the quest for a logic capturing PTime the next natural classes of str...
read it

On the WeisfeilerLeman Dimension of Finite Groups
In comparison to graphs, combinatorial methods for the isomorphism probl...
read it

Deep Weisfeiler Leman
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
read it

Walk refinement, walk logic, and the iteration number of the WeisfeilerLeman algorithm
We show that the 2dimensional WeisfeilerLeman algorithm stabilizes nv...
read it

A unifying method for the design of algorithms canonizing combinatorial objects
We devise a unified framework for the design of canonization algorithms....
read it

An improved isomorphism test for boundedtreewidth graphs
We give a new fpt algorithm testing isomorphism of nvertex graphs of tr...
read it

A Faster Isomorphism Test for Graphs of Small Degree
Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...
read it

Towards faster isomorphism tests for boundeddegree graphs
Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs...
read it

SpaceEfficient Algorithms for Longest Increasing Subsequence
Given a sequence of integers, we want to find a longest increasing subse...
read it

The WeisfeilerLeman Dimension of Planar Graphs is at most 3
We prove that the WeisfeilerLeman (WL) dimension of the class of all fi...
read it
Pascal Schweitzer
is this you? claim profile