{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:34Z","timestamp":1750307374342,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1810959.1810975","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"97-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Linkless and flat embeddings in 3-space and the unknot problem"],"prefix":"10.1145","author":[{"given":"Ken-ichi","family":"Kawarabayashi","sequence":"first","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[{"name":"The University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojan","family":"Mohar","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510016"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90006-K"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174650"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90004-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90093-F"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1834"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/147\/01168"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190070410"},{"key":"e_1_3_2_1_10_1","volume-title":"Handbook of Theoretical Computer Science, 2, 194--242","author":"Courcelle B.","year":"1990","unstructured":"B. Courcelle , Graph rewriting: An algebraic and logic approach . In. J. van Leeuwen, Editor, Handbook of Theoretical Computer Science, 2, 194--242 , Elsevier Sicenence Publishers , ( 1990 ). B. Courcelle, Graph rewriting: An algebraic and logic approach. In. J. van Leeuwen, Editor, Handbook of Theoretical Computer Science, 2, 194--242, Elsevier Sicenence Publishers, (1990)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01455155"},{"key":"e_1_3_2_1_12_1","volume-title":"Graph Theory","author":"Diestel R.","year":"2000","unstructured":"R. Diestel , Graph Theory , 2 nd Edition, Springer , 2000 . R. Diestel, Graph Theory, 2nd Edition, Springer, 2000.","edition":"2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1862"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00014"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796249"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796382"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02559591"},{"volume-title":"Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05)","author":"Hara M.","key":"e_1_3_2_1_18_1","unstructured":"M. Hara , S. Tani and M. Yamamoto , Unknotting is in AM \u2229 co-AM , Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05) , 359--364. M. Hara, S. Tani and M. Yamamoto, Unknotting is in AM \u2229 co-AM, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), 359--364."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/321850.321852"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2008.10.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250848"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374443"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.53"},{"key":"e_1_3_2_1_24_1","unstructured":"K. Kawarabayashi S. Norine R. Thomas and P. Wollan K6 minors in large 6-connected graphs submitted. Available at http:\/\/www.math.princeton.edu\/~snorin\/papers\/k6large. pdf. K. Kawarabayashi S. Norine R. Thomas and P. Wollan K6 minors in large 6-connected graphs submitted. Available at http:\/\/www.math.princeton.edu\/~snorin\/papers\/k6large. pdf."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806784"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.4064\/fm-15-1-271-283"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209046"},{"key":"e_1_3_2_1_29_1","volume-title":"Steinitz representations","author":"Lov\u00e1sz L.","year":"2000","unstructured":"L. Lov\u00e1sz , Steinitz representations , 2000 , http:\/\/www.cs.elte.hu\/lovasz\/klee.ppt L. Lov\u00e1sz, Steinitz representations, 2000, http:\/\/www.cs.elte.hu\/lovasz\/klee.ppt"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1703"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-98-04244-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-17.3.369"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237986"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019529248X"},{"key":"e_1_3_2_1_35_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 , Johns Hopkins University Press , Baltimore, MD , 2001 . B. Mohar and C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, MD, 2001."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21956"},{"key":"e_1_3_2_1_37_1","first-page":"87","volume-title":"Tree width and tangles: a new connectivity measure and some applications, in 'Surveys in Combinatorics","author":"Reed B.","year":"1997","unstructured":"B. Reed , Tree width and tangles: a new connectivity measure and some applications, in 'Surveys in Combinatorics , 1997 (London)', London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press , Cambridge, 1997, pp. 87 -- 162 . B. Reed, Tree width and tangles: a new connectivity measure and some applications, in 'Surveys in Combinatorics, 1997 (London)', London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, Cambridge, 1997, pp. 87--162."},{"key":"e_1_3_2_1_38_1","unstructured":"B. Reed and D. Wood A linear time algorithm to find a separator in a graph with anexcluded minor submitted. B. Reed and D. Wood A linear time algorithm to find a separator in a graph with anexcluded minor submitted."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(90)90063-6"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202354"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1073"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1030"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1031"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1032"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/147\/01167"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4310\/jdg\/1214447220"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90158-2"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844848"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(80)80039-4"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70385-6"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.322451"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02566522"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810975","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1810975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:01Z","timestamp":1750245781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810975"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":55,"alternative-id":["10.1145\/1810959.1810975","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1810975","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}