{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:51:00Z","timestamp":1773762660452,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T00:00:00Z","timestamp":1367280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00453-013-9787-y","type":"journal-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:43:05Z","timestamp":1367368985000},"page":"120-138","source":"Crossref","is-referenced-by-count":11,"title":["Colored Hypergraph Isomorphism is Fixed Parameter Tractable"],"prefix":"10.1007","volume":"71","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bireswar","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seinosuke","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,30]]},"reference":[{"key":"9787_CR1","series-title":"Leibniz International Proceedings in Informatics","first-page":"327","volume-title":"Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","author":"V. Arvind","year":"2010","unstructured":"Arvind, V., Das, B., K\u00f6bler, J., Toda, S.: Colored hypergraph isomorphism is fixed parameter tractable. In: Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Leibniz International Proceedings in Informatics, vol. 8, pp. 327\u2013337. Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2010)"},{"key":"9787_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/11672142_31","volume-title":"Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS)","author":"V. Arvind","year":"2006","unstructured":"Arvind, V., K\u00f6bler, J.: On hypergraph and graph isomorphism with bounded color classes. In: Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 3884, pp. 384\u2013395. Springer, Berlin (2006)"},{"key":"9787_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1007\/978-3-642-22685-4_39","volume-title":"Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON)","author":"V. Arvind","year":"2011","unstructured":"Arvind, V., K\u00f6bler, J.: Canonizing hypergraphs under Abelian group action. In: Proceedings of the 17th Annual International Computing and Combinatorics Conference (COCOON). Lecture Notes in Computer Science, vol. 6842, pp. 444\u2013455. Springer, Berlin (2011)"},{"key":"9787_CR4","unstructured":"Babai, L.: Monte-carlo algorithms in graph isomorphism testing. Technical report 79-10, Universit\u00e9 de Montr\u00e9al (1979)"},{"key":"9787_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-10854-8_4","volume-title":"Proceedings of the 3rd International Symposium Fundamentals of Computation Theory (FCT)","author":"L. Babai","year":"1981","unstructured":"Babai, L.: Moderately exponential bounds for graph isomorphism. In: Proceedings of the 3rd International Symposium Fundamentals of Computation Theory (FCT). Lecture Notes in Computer Science, vol. 117, pp. 34\u201350. Springer, Berlin (1981)"},{"key":"9787_CR6","first-page":"667","volume-title":"Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"L. Babai","year":"2008","unstructured":"Babai, L., Codenotti, P.: Isomorhism of hypergraphs of low rank in moderately exponential time. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0667\u2013676 (2008)"},{"key":"9787_CR7","first-page":"162","volume-title":"Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"L. Babai","year":"1983","unstructured":"Babai, L., Kantor, W.M., Luks, E.M.: Computational complexity and the classification of finite simple groups. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013171 (1983)"},{"key":"9787_CR8","first-page":"171","volume-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC)","author":"L. Babai","year":"1983","unstructured":"Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 171\u2013183 (1983)"},{"issue":"4","key":"9787_CR9","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H.L. Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algor. 11(4), 631\u2013643 (1990)","journal-title":"J. Algor."},{"issue":"4","key":"9787_CR10","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24(4), 873\u2013921 (1995)","journal-title":"SIAM J. Comput."},{"key":"9787_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"3","key":"9787_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s004930050059","volume":"19","author":"S. Evdokimov","year":"1999","unstructured":"Evdokimov, S., Ponomarenko, I.: Isomorphism of colored graphs with slowly increasing multiplicity of Jordan blocks. Combinatorica 19(3), 321\u2013333 (1999)","journal-title":"Combinatorica"},{"key":"9787_CR13","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)"},{"key":"9787_CR14","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J.E., Luks, E.M.: Polynomial-time algorithms for permutation groups. Technical report, Cornell University (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"9787_CR15","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/092","volume-title":"Finite Group Theory","author":"I.M. Isaacs","year":"2008","unstructured":"Isaacs, I.M.: Finite Group Theory. American Mathematical Society, Philadelphia (2008)"},{"issue":"3","key":"9787_CR16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/S0022-0000(03)00042-4","volume":"66","author":"B. Jenner","year":"2003","unstructured":"Jenner, B., K\u00f6bler, J., McKenzie, P., Tor\u00e1n, J.: Completeness results for graph isomorphism. J. Comput. Syst. Sci. 66(3), 549\u2013566 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9787_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-13731-0_9","volume-title":"Proceedings of the 12th Scandinavian Workshop on Algorithm Theory (SWAT)","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Schweitzer, P.: Isomorphism for graphs of bounded feedback vertex set number. In: Kaplan, H. (ed.) Proceedings of the 12th Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science, vol. 6139, pp. 81\u201392. Springer, Berlin (2010)"},{"key":"9787_CR18","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1993)"},{"key":"9787_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/11780342_26","volume-title":"Logical Approaches to Computational Barriers","author":"J. K\u00f6bler","year":"2006","unstructured":"K\u00f6bler, J.: On graph isomorphism for restricted graph classes. In: Logical Approaches to Computational Barriers. Lecture Notes in Computer Science, vol. 3988, pp. 241\u2013256. Springer, Berlin (2006)"},{"issue":"1","key":"9787_CR20","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"E.M. Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25(1), 42\u201365 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"9787_CR21","series-title":"Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume-title":"Groups and Computation","author":"E.M. Luks","year":"1993","unstructured":"Luks, E.M.: Permutation groups and polynomial-time computation. In: Finkelstein, L., Kantor, W.M. (eds.) Groups and Computation. Discrete Mathematics and Theoretical Computer Science, vol. 11, pp. 139\u2013175. American Mathematical Society, Philadelphia (1993)"},{"key":"9787_CR22","first-page":"652","volume-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC)","author":"E.M. Luks","year":"1999","unstructured":"Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), pp. 652\u2013658 (1999)"},{"key":"9787_CR23","first-page":"225","volume-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC)","author":"G.L. Miller","year":"1980","unstructured":"Miller, G.L.: Isomorphism testing for graphs of bounded genus. In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC), pp. 225\u2013235 (1980)"},{"issue":"1\u20132","key":"9787_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(83)80047-3","volume":"56","author":"G.L. Miller","year":"1983","unstructured":"Miller, G.L.: Isomorphism of k-contractible graphs. Inf. Con. 56(1\u20132), 1\u201320 (1983)","journal-title":"Inf. Con."},{"key":"9787_CR25","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, London (2006)"},{"key":"9787_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"\u00c1. Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"9787_CR27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/B978-0-08-012975-4.50020-5","volume-title":"Computational Problems in Abstract Algebra","author":"C.C. Sims","year":"1970","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169\u2013183. Pergamon, Elmsford (1970)"},{"key":"9787_CR28","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0103126","volume-title":"Topics in Algebra","author":"C.C. Sims","year":"1978","unstructured":"Sims, C.C.: Some group theoretic algorithms. In: Dold, A., Eckmann, B. (eds.) Topics in Algebra. Lecture Notes in Mathematics, vol. 697, pp. 108\u2013124. Springer, Berlin (1978)"},{"issue":"8","key":"9787_CR29","doi-asserted-by":"crossref","first-page":"2388","DOI":"10.1093\/ietisy\/e89-d.8.2388","volume":"89-D","author":"S. Toda","year":"2006","unstructured":"Toda, S.: Computing automorphism groups of chordal graphs whose simplicial components are of small size. IEICE Trans. Inform. Syst. 89-D(8), 2388\u20132401 (2006)","journal-title":"IEICE Trans. Inform. Syst."},{"issue":"2","key":"9787_CR30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/PL00009273","volume":"24","author":"K. Yamazaki","year":"1999","unstructured":"Yamazaki, K., Bodlaender, H.L., de Fluiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. Algorithmica 24(2), 105\u2013127 (1999)","journal-title":"Algorithmica"},{"key":"9787_CR31","first-page":"83","volume":"118","author":"V.N. Zemlyachenko","year":"1982","unstructured":"Zemlyachenko, V.N., Kornienko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta 118, 83\u2013158 (1982)","journal-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9787-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9787-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9787-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T06:49:53Z","timestamp":1563000593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9787-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,30]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9787"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9787-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,30]]}}}