6 citations · 10 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
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…
cs.DS2019★ 1 cited
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…