{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:58Z","timestamp":1773762658767,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316338","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"1247-1258","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A unifying method for the design of algorithms canonizing combinatorial objects"],"prefix":"10.1145","author":[{"given":"Pascal","family":"Schweitzer","sequence":"first","affiliation":[{"name":"TU Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Wiebking","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9787-y"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1157970"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316356"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.80"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133143"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(82)90323-4"},{"key":"e_1_3_2_1_8_1","series-title":"Lecture Notes in Computer Science","first-page":"62","volume-title":"ICALP (1)","author":"Babai L\u00e1szl\u00f3"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.10"},{"key":"e_1_3_2_1_10_1","first-page":"183","volume-title":"Proceedings of the fifteenth annual ACM symposium on Theory of computing","author":"Babai L\u00e1szl\u00f3"},{"issue":"545","key":"e_1_3_2_1_11_1","first-page":"590","article-title":"A fast isomorphism test for groups whose lie algebra has genus 2","volume":"473","author":"Brooksbank Peter A.","year":"2017","journal-title":"Journal of Algebra"},{"key":"e_1_3_2_1_12_1","volume-title":"The University of Chicago","author":"Codenotti Paolo","year":"2011"},{"key":"e_1_3_2_1_13_1","unstructured":"{GNS18} Martin Grohe Daniel Neuen and Pascal Schweitzer. A faster isomorphism test for graphs of small degree. CoRR abs\/1802.04659 2018.  {GNS18} Martin Grohe Daniel Neuen and Pascal Schweitzer. A faster isomorphism test for graphs of small degree. CoRR abs\/1802.04659 2018."},{"key":"e_1_3_2_1_14_1","unstructured":"{GNSW18} Martin Grohe Daniel Neuen Pascal Schweitzer and Daniel Wiebking. An improved isomorphism test for bounded-tree-width graphs. CoRR abs\/1803.06858 03 2018.  {GNSW18} Martin Grohe Daniel Neuen Pascal Schweitzer and Daniel Wiebking. An improved isomorphism test for bounded-tree-width graphs. CoRR abs\/1803.06858 03 2018."},{"key":"e_1_3_2_1_15_1","unstructured":"{GQ15} \n      \n      Joshua\n     A.\n      \n  \n   \n  Grochow and Youming Qiao. Polynomial-time isomorphism test of groups that are tame extensions - (extended abstract). In Khaled M. Elbassioni and Kazuhisa Makino editors Algorithms and Computation - 26th International Symposium ISAAC\n   \n  2015 Nagoya Japan December 9-11 2015 Proceedings volume \n  9472\n   of \n  Lecture Notes in Computer Science pages 578\u2013\n  589\n  . Springer 2015.  {GQ15} Joshua A. Grochow and Youming Qiao. Polynomial-time isomorphism test of groups that are tame extensions - (extended abstract). In Khaled M. Elbassioni and Kazuhisa Makino editors Algorithms and Computation - 26th International Symposium ISAAC 2015 Nagoya Japan December 9-11 2015 Proceedings volume 9472 of Lecture Notes in Computer Science pages 578\u2013589. Springer 2015."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009767"},{"key":"e_1_3_2_1_17_1","unstructured":"{GS15} Martin Grohe and Pascal Schweitzer. Isomorphism testing for graphs of bounded rank width. CoRR abs\/1505.03737 2015.  {GS15} Martin Grohe and Pascal Schweitzer. Isomorphism testing for graphs of bounded rank width. CoRR abs\/1505.03737 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00288-X"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301427"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1515\/gcc-2012-0008"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90004-8"},{"key":"e_1_3_2_1_23_1","first-page":"327","volume-title":"Foundations of Computation Theory","author":"Miller Gary"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.036"},{"key":"e_1_3_2_1_25_1","unstructured":"{Ser03} \n      \n      \u00c1kos\n       \n      Seress\n    .\n      \n  \n   \n  Permutation group algorithms volume \n  152\n   of \n  Cambridge Tracts in Mathematics\n  . \n  Cambridge University Press Cambridge 2003\n  .  {Ser03} \u00c1kos Seress. Permutation group algorithms volume 152 of Cambridge Tracts in Mathematics. Cambridge University Press Cambridge 2003."},{"key":"e_1_3_2_1_26_1","unstructured":"{SW18} Pascal Schweitzer and Daniel Wiebking. A unifying method for the design of algorithms canonizing combinatorial objects. CoRR abs\/1806.07466 2018.  {SW18} Pascal Schweitzer and Daniel Wiebking. A unifying method for the design of algorithms canonizing combinatorial objects. CoRR abs\/1806.07466 2018."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":26,"alternative-id":["10.1145\/3313276.3316338","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316338","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}