{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:19:36Z","timestamp":1730222376517,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/focs46700.2020.00064","type":"proceedings-article","created":{"date-parts":[[2021,2,17]],"date-time":"2021-02-17T23:27:24Z","timestamp":1613604444000},"page":"625-636","source":"Crossref","is-referenced-by-count":4,"title":["Isomorphism Testing for Graphs Excluding Small Minors"],"prefix":"10.1109","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Wiebking","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Neuen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511662157.003"},{"journal-title":"The power of algorithmic approaches to the graph isomorphism problem","year":"2019","author":"neuen","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(82)90323-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/140999980"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804670"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098279"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80047-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00018"},{"key":"ref15","first-page":"88:1","article-title":"Hypergraph isomorphism for groups with restricted composition factors","volume":"168","author":"neuen","year":"0","journal-title":"47th International Colloquium on Automata Languages and Programming ICALP 2020 July 8&#x2013;11 2020 Saarbr&#x00FC;cken Germany (Virtual Conference)"},{"key":"ref16","first-page":"103:1","article-title":"Graph isomorphism in quasipolynomial time parameterized by treewidth","volume":"168","author":"wiebking","year":"2020","journal-title":"47th International Colloquium on Automata Languages and Programming ICALP 2020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3382082"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316338"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"},{"key":"ref28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4176-8","volume":"148","author":"rotman","year":"1995","journal-title":"An Introduction to the Theory of Groups"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"ref27","first-page":"59","article-title":"Describing graphs: A first-order approach to graph canonization","author":"immerman","year":"1988","journal-title":"Complexity Theory Retrospective In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref6","first-page":"236","article-title":"A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus (working paper)","author":"filotti","year":"1980","journal-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0731-3","volume":"163","author":"dixon","year":"1996","journal-title":"ser Graduate Texts in Mathematics"},{"journal-title":"The reduction of a graph to canonical form and the algebra which appears therein","year":"1968","author":"weisfeiler","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.66"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.10"},{"key":"ref9","first-page":"131","article-title":"Isomorphism of planar graphs","author":"hopcroft","year":"1972","journal-title":"Proceedings of a symposium on the Complexity of Computer Computations held March 20&#x2013;22 1972 at the IBM Thomas J Watson Research Center Yorktown Heights New York USA"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1993-00335-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579141"},{"key":"ref21","article-title":"Graph minors I-XXIII","author":"robertson","year":"0","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"ref24","article-title":"Isomorphism testing for graphs excluding small minors","volume":"abs 2004 7671","author":"grohe","year":"2020","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100061521"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9686-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01364272"}],"event":{"name":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2020,11,16]]},"location":"Durham, NC, USA","end":{"date-parts":[[2020,11,19]]}},"container-title":["2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9317865\/9317869\/09317879.pdf?arnumber=9317879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T17:49:02Z","timestamp":1656438542000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9317879\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/focs46700.2020.00064","relation":{},"subject":[],"published":{"date-parts":[[2020,11]]}}}