On Weisfeiler-Leman invariance: Subgraph counts and related graph properties. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (J. Comput. Syst. Sci., 2020)

Local WL invariance and hidden shades of regularity. - Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (Discret. Appl. Math., 2021)

Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm. - Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (SIAM J. Discret. Math., 2021)

The Weisfeiler-Leman algorithm and recognition of graph properties. - Frank Fuhlbrück; Johannes Köbler; Ilia Ponomarenko; Oleg Verbitsky 001 (Theor. Comput. Sci., 2021)

On the Weisfeiler-Leman dimension of fractional packing. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (Inf. Comput., 2022)

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan (ACM Trans. Comput. Theory, 2022)

On a Hierarchy of Spectral Isomorphism Invariants. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (CoRR, 2023)

On a Hierarchy of Spectral Invariants for Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001 (STACS, 2024)

Gathering Information about a Graph by Counting Walks from a Single Vertex. - Frank Fuhlbrück; Johannes Köbler; Oleg Verbitsky 001; Maksim Zhukovskii (CoRR, 2024)