{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T02:18:38Z","timestamp":1772849918253,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"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":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188900","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"138-150","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["An exponential lower bound for individualization-refinement algorithms for graph isomorphism"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Neuen","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[{"name":"TU Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"L\u00e1szl\u00f3 Babai. 1979. L\u00e1szl\u00f3 Babai. 1979."},{"key":"e_1_3_2_1_2_1","unstructured":"Monte Carlo algorithms in graph isomorphism testing. Technical Report 79-10. Universit\u00e9 de Montr\u00e9al. Monte Carlo algorithms in graph isomorphism testing. Technical Report 79-10. Universit\u00e9 de Montr\u00e9al."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 1981 International FCT-Conference","volume":"117","author":"Babai L\u00e1szl\u00f3","year":"1981"},{"key":"e_1_3_2_1_4_1","volume-title":"Graph isomorphism in quasipolynomial time. arXiv preprint arXiv:1512.03547","author":"Babai L\u00e1szl\u00f3","year":"2016"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai. 2016. L\u00e1szl\u00f3 Babai. 2016.","DOI":"10.30716\/RSZ\/2016\/1\/15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_7_1","volume-title":"Luks","author":"Babai L\u00e1szl\u00f3","year":"1983"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397003040"},{"key":"e_1_3_2_1_12_1","volume-title":"Markov","author":"Codenotti Paolo","year":"2013"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.139"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.34"},{"key":"e_1_3_2_1_15_1","unstructured":"Mark.K. Goldberg. 1983. Mark.K. Goldberg. 1983."},{"key":"e_1_3_2_1_16_1","volume-title":"Discrete Applied Mathematics 6, 3","author":"A","year":"1983"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.2307\/2275675"},{"key":"e_1_3_2_1_18_1","unstructured":"Neil Immerman and Eric Lander. 1990. Neil Immerman and Eric Lander. 1990."},{"key":"e_1_3_2_1_19_1","volume-title":"A First-Order Approach to Graph Canonization","author":"Graphs Describing"},{"key":"e_1_3_2_1_20_1","unstructured":"Tommi Junttila and Petteri Kaski. 2007. Tommi Junttila and Petteri Kaski. 2007."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithms and Combinatorics, David Applegate, Gerth St\u00f8lting Brodal","author":"Engineering"},{"key":"e_1_3_2_1_22_1","volume-title":"Junttila and Petteri Kaski","author":"Tommi","year":"2011"},{"key":"e_1_3_2_1_23_1","volume-title":"Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS","author":"Propagation Conflict","year":"2011"},{"key":"e_1_3_2_1_24_1","volume-title":"Antonio Fern\u00e1ndez Anta, and Luis N\u00fa\u00f1ez Chiroque","author":"L\u00f3pez-Presa Jos\u00e9 Luis","year":"2011"},{"key":"e_1_3_2_1_25_1","volume-title":"Fast Isomorphism Testing and Automorphism Group Computation. CoRR abs\/1108.1060","year":"2011"},{"key":"e_1_3_2_1_26_1","volume-title":"Congr. Numer. 30","author":"McKay Brendan D.","year":"1981"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.003"},{"key":"e_1_3_2_1_28_1","volume-title":"Groups and Computation (DIMACS Series in Discrete Mathematics and Theoretical Computer Science)","volume":"28","author":"Miyazaki Takunari","year":"1995"},{"key":"e_1_3_2_1_29_1","unstructured":"Rajeev Motwani and Prabhakar Raghavan. 1995. Rajeev Motwani and Prabhakar Raghavan. 1995."},{"key":"e_1_3_2_1_30_1","unstructured":"Randomized Algorithms. Cambridge University Press. Randomized Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_31_1","unstructured":"Daniel Neuen and Pascal Schweitzer. 2017. Daniel Neuen and Pascal Schweitzer. 2017."},{"key":"e_1_3_2_1_32_1","volume-title":"Graphs for Practical Graph Isomorphism. In 25th Annual European Symposium on Algorithms, ESA 2017","volume":"87","author":"Benchmark","year":"2017"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"e_1_3_2_1_34_1","first-page":"83","article-title":"The graph isomorphism problem","volume":"118","author":"Zemlyachenko V. N.","year":"1982","journal-title":"Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI)"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188900","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188900","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:10Z","timestamp":1750212430000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":34,"alternative-id":["10.1145\/3188745.3188900","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188900","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}