1 citations · 1 across the 1 of their papers we have counts for
4 papers · 1 filter
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…
An improved isomorphism test for bounded-tree-width graphs
Martin Grohe, Daniel Neuen, Pascal Schweitzer +1
We give a new fpt algorithm testing isomorphism of -vertex graphs of tree width in time , improving the fpt algorithm…