@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2010.327,
author = {Arvind, V. and Das, Bireswar and K\"{o}bler, Johannes and Toda, Seinosuke},
title = {{Colored Hypergraph Isomorphism is Fixed Parameter Tractable}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {327--337},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.327},
URN = {urn:nbn:de:0030-drops-28751},
doi = {10.4230/LIPIcs.FSTTCS.2010.327},
annote = {Keywords: Fixed parameter tractability, fpt algorithms, graph isomorphism, computational complexity}
}