{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:06:34Z","timestamp":1759881994108,"version":"build-2065373602"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T00:00:00Z","timestamp":1666224000000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1145\/3550496","type":"journal-article","created":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T11:14:13Z","timestamp":1666264453000},"page":"88-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Theory research in India"],"prefix":"10.1145","volume":"65","author":[{"given":"C.","family":"Aiswarya","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute in Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Arvind","sequence":"additional","affiliation":[{"name":"Institute of Mathematical Sciences in Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[{"name":"Institute of Mathematical Sciences in Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1","article-title":"Deciding reachability under persistent x86-TSO. In Proceedings of 2021 ACM Program","volume":"5","author":"Abdulla P.A.","unstructured":"Abdulla, P.A., Atig, M.F., Bouajjani, A., Kumar, K.N. and Saivasan, P. Deciding reachability under persistent x86-TSO. In Proceedings of 2021 ACM Program. Lang. 5, 1--32.","journal-title":"Lang."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 48th Annual ACM SIGACT Symp. Theory of Computing","author":"Babai L.","year":"2016","unstructured":"Babai, L. Graph isomorphism in quasipolynomial time. In Proceedings of the 48th Annual ACM SIGACT Symp. Theory of Computing, (2016), 684--697."},{"key":"e_1_2_1_3_1","first-page":"183","article-title":"Luks, E.M. Canonical labeling of graphs","volume":"171","author":"Babai L.","year":"1983","unstructured":"Babai, L. and Eugene M. Luks, E.M. Canonical labeling of graphs. STOC, 1983, 171--183.","journal-title":"STOC"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384244"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90013-5"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451069"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3531130.3533364"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209182"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS52264.2021.9470738"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804671"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.38"},{"key":"e_1_2_1_12_1","first-page":"488","article-title":"Finding topological subgraphs is fixed-parameter tractable","volume":"479","author":"Grohe M.","year":"2011","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., and Wollan, P. Finding topological subgraphs is fixed-parameter tractable. STOC, 2011, 479--488.","journal-title":"STOC"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.30"},{"key":"e_1_2_1_14_1","first-page":"192","article-title":"Structure theorem and isomorphism test for graphs with excluded topological subgraphs","volume":"173","author":"Grohe M.","year":"2012","unstructured":"Grohe, M. and Marx, D. Structure theorem and isomorphism test for graphs with excluded topological subgraphs. STOC, 2012, 173--192.","journal-title":"STOC"},{"key":"e_1_2_1_15_1","volume-title":"Recent advances on the graph isomorphism problem. CoRR","author":"Grohe M.","year":"2020","unstructured":"Grohe, M. and Neuen, D. Recent advances on the graph isomorphism problem. CoRR, 2020; abs\/2011.01366."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453943"},{"key":"e_1_2_1_17_1","first-page":"100","article-title":"and Schweitzer, P. A faster isomorphism test for graphs of small degree. In Proceedings of the 59th IEEE Annual Symp","volume":"89","author":"Grohe M.","year":"2018","unstructured":"Grohe, M. and Neuen, D. and Schweitzer, P. A faster isomorphism test for graphs of small degree. In Proceedings of the 59th IEEE Annual Symp. Foundations of Computer Science, 2018, 89--100.","journal-title":"Foundations of Computer Science"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382082"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.66"},{"key":"e_1_2_1_20_1","first-page":"636","article-title":"Isomorphism testing for graphs excluding small minors. In Proceedings of the 61st IEEE Annual Symp","volume":"625","author":"Grohe M.","year":"2020","unstructured":"Grohe, M., Wiebking, D., and Neuen, D. Isomorphism testing for graphs excluding small minors. In Proceedings of the 61st IEEE Annual Symp. Foundations of Computer Science, 2020, 625--636.","journal-title":"Foundations of Computer Science"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384277"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_13"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80013-3"},{"key":"e_1_2_1_24_1","first-page":"184","article-title":"Linear time algorithm for isomorphism of planar graphs","volume":"172","author":"Hopcroft J.E","year":"1974","unstructured":"Hopcroft, J.E and Wong, J.K. Linear time algorithm for isomorphism of planar graphs. STOC, 1974, 172--184.","journal-title":"STOC"},{"key":"e_1_2_1_25_1","unstructured":"Kawarabayashi K. Graph isomorphism for bounded genus graphs in linear time. CoRR 2; abs\/1511.02460."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00083"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00079"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/140999980"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520076"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_2_1_31_1","first-page":"235","article-title":"Isomorphism testing for graphs of bounded genus","volume":"225","author":"Miller G.L","year":"1980","unstructured":"Miller, G.L. Isomorphism testing for graphs of bounded genus. STOC, 1980, 225--235.","journal-title":"STOC"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00042"},{"key":"e_1_2_1_33_1","first-page":"1","article-title":"Hypergraph isomorphism for groups with restricted composition fac- tors. In 47th Intern. Colloquium on Automata, Languages, and Programming 168, 2020","volume":"88","author":"Neuen D","unstructured":"Neuen, D. Hypergraph isomorphism for groups with restricted composition fac- tors. In 47th Intern. Colloquium on Automata, Languages, and Programming 168, 2020. Schloss Dagstuhl---Leibniz-Zentrum f\u00fcr Informatik, 88:1--88:19.","journal-title":"Schloss Dagstuhl---Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 29th Annual European Symp. Algorithms 204","author":"Neuen D.","year":"2021","unstructured":"Neuen, D. Isomorphism testing parameterized by genus and beyond. In Proceedings of the 29th Annual European Symp. Algorithms 204, 2021. Schloss Dagstuhl---Leibniz-Zentrum f\u00fcr Informatik, 72:1--72:18"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098279"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1966.1082573"},{"key":"e_1_2_1_37_1","first-page":"1","article-title":"Graph isomorphism in quasipolynomial time parameterized by treewidth. In 47th Intern. Colloquium on Automata, Languages, and Programming 168, 2020","volume":"103","author":"Wiebking D","unstructured":"Wiebking, D. Graph isomorphism in quasipolynomial time parameterized by treewidth. In 47th Intern. Colloquium on Automata, Languages, and Programming 168, 2020. Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, 103:1--103:16.","journal-title":"Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3550496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3550496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T00:51:43Z","timestamp":1759798303000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3550496"}},"subtitle":["2019--2022"],"short-title":[],"issued":{"date-parts":[[2022,10,20]]},"references-count":37,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["10.1145\/3550496"],"URL":"https:\/\/doi.org\/10.1145\/3550496","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2022,10,20]]},"assertion":[{"value":"2022-10-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}