{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:57Z","timestamp":1759638417385,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001655","name":"German Academic Exchange Service","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,31]]},"DOI":"10.1145\/2591796.2591865","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T12:01:58Z","timestamp":1443700918000},"page":"383-392","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Embedding and canonizing graphs of bounded genus in logspace"],"prefix":"10.1145","author":[{"given":"Michael","family":"Elberfeld","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"additional","affiliation":[{"name":"National Institute of Informatics and JST ERATO Kawarabayashi Large Graph Project, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"641","volume-title":"Proc. SODA 2008","author":"Adler I.","year":"2008","unstructured":"I. Adler , M. Grohe , and S. Kreutzer . Computing excluded minors . In Proc. SODA 2008 , pages 641 -- 650 . SIAM, 2008 . I. Adler, M. Grohe, and S. Kreutzer. Computing excluded minors. In Proc. SODA 2008, pages 641--650. SIAM, 2008."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2003.09.002"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9172-z"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2001.2083"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1490270.1490274"},{"key":"e_1_3_2_2_6_1","first-page":"254","volume-title":"Proc. STACS 2012","volume":"14","author":"Datta S.","year":"2012","unstructured":"S. Datta , A. Gopalan , R. Kulkarni , and R. Tewari . Improved bounds for bipartite matching on surfaces . In Proc. STACS 2012 , volume 14 of LIPIcs, pages 254 -- 265 . Dagstuhl , 2012 . S. Datta, A. Gopalan, R. Kulkarni, and R. Tewari. Improved bounds for bipartite matching on surfaces. In Proc. STACS 2012, volume 14 of LIPIcs, pages 254--265. Dagstuhl, 2012."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.11.002"},{"key":"e_1_3_2_2_8_1","first-page":"155","volume-title":"Proc. FSTTCS 2008","volume":"2","author":"Datta S.","year":"2008","unstructured":"S. Datta , N. Limaye , and P. Nimbhorkar . 3-connected planar graph isomorphism is in log-space . In Proc. FSTTCS 2008 , volume 2 of LIPIcs, pages 155 -- 162 . Dagstuhl , 2008 . S. Datta, N. Limaye, and P. Nimbhorkar. 3-connected planar graph isomorphism is in log-space. In Proc. FSTTCS 2008, volume 2 of LIPIcs, pages 155--162. Dagstuhl, 2008."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.16"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008967.2009037"},{"key":"e_1_3_2_2_11_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2005","unstructured":"R. Diestel . Graph Theory , volume 173 . Springer , 3 rd edition, 2005 . R. Diestel. Graph Theory, volume 173. Springer, 3rd edition, 2005.","edition":"3"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103456"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.21"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804395"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335313"},{"key":"e_1_3_2_2_16_1","first-page":"414","volume-title":"Proc.","author":"Grohe M.","year":"2012","unstructured":"M. Grohe , K.-i. Kawarabayashi , and B. A. Reed . A simple algorithm for the graph minor decomposition -- logic meets structural graph theory . In Proc. 2012 , pages 414 -- 431 . SIAM , 2013. M. Grohe, K.-i. Kawarabayashi, and B. A. Reed. A simple algorithm for the graph minor decomposition -- logic meets structural graph theory. In Proc. 2012, pages 414--431. SIAM, 2013."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/502976"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00042-4"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.53"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00023-5"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1714450.1714451"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129750"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335346"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90015-P"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1992-075-0"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192526"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019529248X"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"Mohar B.","year":"2001","unstructured":"B. Mohar and C. Thomassen . Graphs on Surfaces . The Johns Hopkins University Press , 2001 . B. Mohar and C. Thomassen. Graphs on Surfaces. The Johns Hopkins University Press, 2001."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/866043"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90070-6"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90121-F"},{"key":"e_1_3_2_2_33_1","first-page":"293","volume-title":"Paths, Flows, and vlsi-layout","author":"Robertson N.","year":"1990","unstructured":"N. Robertson and R. Vitray . Representativity of surface embeddings . In Paths, Flows, and vlsi-layout , pages 293 -- 328 . Springer-Verlag , Berlin , 1990 . N. Robertson and R. Vitray. Representativity of surface embeddings. In Paths, Flows, and vlsi-layout, pages 293--328. Springer-Verlag, Berlin, 1990."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.15"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90006-0"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90115-G"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1997.1761"}],"event":{"name":"STOC '14: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York","acronym":"STOC '14"},"container-title":["Proceedings of the forty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591865","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2591796.2591865","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:45Z","timestamp":1750229745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2591796.2591865"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":37,"alternative-id":["10.1145\/2591796.2591865","10.1145\/2591796"],"URL":"https:\/\/doi.org\/10.1145\/2591796.2591865","relation":{},"subject":[],"published":{"date-parts":[[2014,5,31]]},"assertion":[{"value":"2014-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}