A unifying method for the design of algorithms canonizing combinatorial objects. - Pascal Schweitzer; Daniel Wiebking (STOC, 2019)

Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth. - Daniel Wiebking (ICALP, 2020)

Normalizers and permutational isomorphisms in simply-exponential time. - Daniel Wiebking (SODA, 2020)

Automorphism groups of graphs of bounded Hadwiger number. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (CoRR, 2020)

An Improved Isomorphism Test for Bounded-tree-width Graphs. - Martin Grohe; Daniel Neuen; Pascal Schweitzer; Daniel Wiebking (ACM Trans. Algorithms, 2020)

Deep Weisfeiler Leman. - Martin Grohe; Pascal Schweitzer; Daniel Wiebking (SODA, 2021)

Isomorphism Testing for Graphs Excluding Small Minors. - Martin Grohe; Daniel Neuen; Daniel Wiebking (SIAM J. Comput., 2023)