COLORED HYPERGRAPH ISOMORPHISM is fixed parameter tractable

We describe a fixed parameter tractable (fpt) algorithm for COLORED HYPERGRAPH ISOMORPHISM which has running time 2^O(b)N^O(1), where the parameter b is the maximum size of the color classes of the given hypergraphs and N is the input size. We also describe fpt algorithms for certain permutation group problems that are used as subroutines in our algorithm. © V. Arvind, Bireswar Das, Johannes Köbler and Seinosuke Toda.