{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:45:03Z","timestamp":1729658703758,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/focs.2018.00018","type":"proceedings-article","created":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T20:21:43Z","timestamp":1543868503000},"page":"89-100","source":"Crossref","is-referenced-by-count":8,"title":["A Faster Isomorphism Test for Graphs of Small Degree"],"prefix":"10.1109","author":[{"given":"Martin","family":"Grohe","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Neuen","sequence":"additional","affiliation":[]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"684","article-title":"Graph isomorphism in quasipolynomial time [extended abstract]","author":"wichs","year":"2016","journal-title":"Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing STOC 2016 Cambridge MA USA"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(82)90323-4"},{"key":"ref12","first-page":"67:1","article-title":"An improved isomorphism test for bounded-tree-width graphs","volume":"107","author":"grohe","year":"2018","journal-title":"45th International Colloquium on Automata Languages and Programming ICALP 2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.28"},{"journal-title":"An Introduction to the Theory of Groups ser Graduate Texts in Mathematics","year":"1999","author":"rotman","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0731-3","volume":"163","author":"dixon","year":"1996","journal-title":"Permutation groups ser Grad Texts in math"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1090\/S0894-0347-99-00288-X","article-title":"Simple groups, permutation groups, and probability","volume":"12","author":"liebeck","year":"1999","journal-title":"J Amer Math Soc"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0021-8693(02)00001-7","article-title":"Bases of primitive linear groups","volume":"252","year":"2002","journal-title":"Journal of Algebra"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jalgebra.2014.01.011","article-title":"Bases of primitive linear groups II","volume":"403","year":"2014","journal-title":"Journal of Algebra"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761072"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/120892234"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.80"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/011\/11"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.dam.2014.10.026","article-title":"Graph isomorphism for graph classes characterized by two forbidden induced subgraphs","volume":"216","author":"kratsch","year":"2017","journal-title":"Discrete Applied Mathematics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098279"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.10"},{"key":"ref9","article-title":"Graph isomorphism in quasipolynomial time","volume":"abs 1512 3547v2","author":"babai","year":"2015","journal-title":"CoRR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511629235","volume":"129","author":"kleidman","year":"1990","journal-title":"The subgroup structure of the finite classical groups ser London Mathematical Society Lecture Note Series"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01193603"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.1997.7149"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-8693(02)00646-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/13.1.1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-0329-9_7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28439"}],"event":{"name":"2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2018,10,7]]},"location":"Paris","end":{"date-parts":[[2018,10,9]]}},"container-title":["2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8554191\/8555078\/08555096.pdf?arnumber=8555096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T12:05:39Z","timestamp":1573041939000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8555096\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":27,"URL":"http:\/\/dx.doi.org\/10.1109\/focs.2018.00018","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}
