research
∙
06/30/2023
Logarithmic Weisfeiler–Leman Identifies All Graphs of Bounded Rank Width
In this paper, we extend the work of Grohe Neuen (ACM T. Comput. Log...
share
research
∙
05/03/2023
Complexity and Enumeration in Models of Genome Rearrangement
In this paper, we examine the computational complexity of enumeration in...
research
∙
03/14/2023
Logarithmic Weisfeiler–Leman and Treewidth
In this paper, we show that the (3k+4)-dimensional Weisfeiler–Leman algo...
research
∙
12/21/2022
Count-Free Weisfeiler–Leman and Group Isomorphism
We investigate the power of counting in Group Isomorphism. We first leve...
research
∙
09/27/2022
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
In this paper, we explore the descriptive complexity theory of finite gr...
research
∙
07/13/2022
On the Complexity of Identifying Strongly Regular Graphs
In this note, we show that Graph Isomorphism (GI) is not ^0-reducible to...
research
∙
04/26/2022
Experience Report: Standards-Based Grading at Scale in Algorithms
We report our experiences implementing standards-based grading at scale ...
research
∙
12/21/2021