Arvind, V.V.ArvindDas, BireswarBireswarDasKöbler, JohannesJohannesKöblerToda, SeinosukeSeinosukeToda2025-08-302025-08-302010-12-01[9783939897231]10.4230/LIPIcs.FSTTCS.2010.3272-s2.0-84880202357http://repository.iitgn.ac.in/handle/IITG2025/21206We 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.falseComputational complexity | Fixed parameter tractability | Fpt algorithms | Graph isomorphismConference Paper327-33720105cpConference Proceeding