6 citations · 10 across the 4 of their papers we have counts for
7 papers
Automorphism groups of graphs of bounded Hadwiger number
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particu…
Isomorphism Testing for Graphs Excluding Small Minors
Martin Grohe, Daniel Neuen, Daniel Wiebking
We prove that there is a graph isomorphism test running in time on -vertex graphs excluding some -vertex graph as a minor. Previously known bo…
Deep Weisfeiler Leman
Martin Grohe, Pascal Schweitzer, Daniel Wiebking
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL), which allows the design of purely combinatorial graph isomorphism tests that are more powerful than the wel…
Graph isomorphism in quasipolynomial time parameterized by treewidth
Daniel Wiebking
We extend Babai's quasipolynomial-time graph isomorphism test (STOC 2016) and develop a quasipolynomial-time algorithm for the multiple-coset isomorphism problem. The algorithm for…
Normalizers and permutational isomorphisms in simply-exponential time
Daniel Wiebking
We show that normalizers and permutational isomorphisms of permutation groups given by generating sets can be computed in time simply exponential in the degree of the groups. The r…
A unifying method for the design of algorithms canonizing combinatorial objects
Pascal Schweitzer, Daniel Wiebking
We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, h…