{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:28:19Z","timestamp":1742956099940,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030604394"},{"type":"electronic","value":"9783030604400"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60440-0_7","type":"book-chapter","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T09:03:18Z","timestamp":1602752598000},"page":"80-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Knot Diagrams of Treewidth Two"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"Burton","sequence":"additional","affiliation":[]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Grigoriev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"1\u20134","key":"7_CR1","doi-asserted-by":"publisher","first-page":"562","DOI":"10.2307\/1968399","volume":"28","author":"JW Alexander","year":"1926","unstructured":"Alexander, J.W., Briggs, G.B.: On types of knotted curves. Ann. Math. (2) 28(1\u20134), 562\u2013586 (1926). https:\/\/doi.org\/10.2307\/1968399","journal-title":"Ann. Math. (2)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial $$k$$-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209, 1\u201345 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR3","unstructured":"Bodlaender, H.L., Burton, B.A., Fomin, F.V., Grigoriev, A.: Knot diagrams of treewidth two (2019). http:\/\/arxiv.org\/abs\/1904.03117"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/10586458.1997.10504350","volume":"6","author":"OT Dasbach","year":"1997","unstructured":"Dasbach, O.T., Hougardy, S.: Does the Jones polynomial detect unknottedness? Exp. Math. 6(1), 51\u201356 (1997)","journal-title":"Exp. Math."},{"key":"7_CR5","unstructured":"de Mesmay, A., Rieck, Y.A., Sedgwick, E., Tancer, M.: The unbearable hardness of unknotting. In: 35th International Symposium on Computational Geometry, SoCG 2019, LIPIcs, vol. 129, pp. 49:1\u201349:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02559591","volume":"105","author":"W Haken","year":"1961","unstructured":"Haken, W.: Theorie der Normalfl\u00e4chen. Acta Math. 105, 245\u2013375 (1961). https:\/\/doi.org\/10.1007\/BF02559591","journal-title":"Acta Math."},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1090\/S0894-0347-01-00358-7","volume":"14","author":"J Hass","year":"2001","unstructured":"Hass, J., Lagarias, J.C.: The number of Reidemeister moves needed for unknotting. J. Am. Math. Soc. 14(2), 399\u2013428 (2001). https:\/\/doi.org\/10.1090\/S0894-0347-01-00358-7","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/301970.301971","volume":"46","author":"J Hass","year":"1999","unstructured":"Hass, J., Lagarias, J.C., Pippenger, N.: The computational complexity of knot and link problems. J. ACM 46(2), 185\u2013211 (1999). https:\/\/doi.org\/10.1145\/301970.301971","journal-title":"J. ACM"},{"key":"7_CR9","unstructured":"Henrich, A., Kauffman, L.H.: Unknotting unknots. arXiv preprint arXiv:1006.4176 (2010)"},{"key":"7_CR10","unstructured":"Koenig, D., Tsvietkova, A.: NP-hard problems naturally arising in knot theory. arXiv preprint arXiv:1809.10334 (2018)"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.4007\/annals.2015.182.2.3","volume":"182","author":"M Lackenby","year":"2015","unstructured":"Lackenby, M.: A polynomial upper bound on Reidemeister moves. Ann. Math. 182(2), 491\u2013564 (2015). https:\/\/doi.org\/10.4007\/annals.2015.182.2.3","journal-title":"Ann. Math."},{"key":"7_CR12","unstructured":"Lackenby, M.: The efficient certification of knottedness and thurston norm. arXiv preprint arXiv:1604.00290 (2016)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1016\/S0022-0000(03)00080-1","volume":"67","author":"JA Makowsky","year":"2003","unstructured":"Makowsky, J.A., Mari\u00f1o, J.P.: The parameterized complexity of knot polynomials. J. Comput. Syst. Sci. 67, 742\u2013756 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF02952506","volume":"5","author":"K Reidemeister","year":"1927","unstructured":"Reidemeister, K.: Knoten und Gruppen. Abh. Math. Sem. Univ. Hamburg 5(1), 7\u201323 (1927). https:\/\/doi.org\/10.1007\/BF02952506","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.endm.2018.06.021","volume":"68","author":"J Ru\u00e9","year":"2018","unstructured":"Ru\u00e9, J., Thilikos, D.M., Velona, V.: Structure and enumeration of $$K_4$$-minor-free links and link diagrams. Electron. Notes Discret. Math. 68, 119\u2013124 (2018). https:\/\/doi.org\/10.1016\/j.endm.2018.06.021","journal-title":"Electron. Notes Discret. Math."},{"key":"7_CR17","volume-title":"Solvable and Unsolvable Problems","author":"AM Turing","year":"1954","unstructured":"Turing, A.M.: Solvable and Unsolvable Problems. Penguin Books, London (1954)"},{"key":"7_CR18","unstructured":"Torus knot (2019). http:\/\/mathworld.wolfram.com\/TorusKnot.html"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60440-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:00:24Z","timestamp":1710266424000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60440-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030604394","9783030604400"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60440-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leeds","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algorithms.leeds.ac.uk\/wg2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}