{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:59:54Z","timestamp":1743137994282,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-58150-3_31","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"384-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constructing Tree Decompositions of Graphs with Bounded Gonality"],"prefix":"10.1007","author":[{"given":"Hans L.","family":"Bodlaender","sequence":"first","affiliation":[]},{"given":"Josse","family":"van Dobben de Bruyn","sequence":"additional","affiliation":[]},{"given":"Dion","family":"Gijswijt","sequence":"additional","affiliation":[]},{"given":"Harry","family":"Smit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"6","key":"31_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.2140\/ant.2008.2.613","volume":"2","author":"M Baker","year":"2008","unstructured":"Baker, M.: Specialization of linear systems from curves to graphs. Algebra Number Theor. 2(6), 613\u2013653 (2008)","journal-title":"Algebra Number Theor."},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.aim.2007.04.012","volume":"215","author":"M Baker","year":"2007","unstructured":"Baker, M., Norine, S.: Riemann-Roch and Abel-Jacobi theory on a finite graph. Adv. Math. 215(2), 766\u2013788 (2007)","journal-title":"Adv. Math."},{"issue":"15","key":"31_CR3","first-page":"2914","volume":"2009","author":"M Baker","year":"2009","unstructured":"Baker, M., Norine, S.: Harmonic morphisms and hyperelliptic graphs. Int. Math. Res. Not. 2009(15), 2914\u20132955 (2009)","journal-title":"Int. Math. Res. Not."},{"key":"31_CR4","volume-title":"Nonserial Dynamic Programming","author":"U Bertele","year":"1972","unstructured":"Bertele, U., Brioschi, F.: Nonserial Dynamic Programming. Academic Press, New York (1972)"},{"key":"31_CR5","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. Theor. Comput. Sci. 209, 1\u201345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., van Dobben de Bruyn, J., Gijswijt, D., Smit, H.: Constructing tree decompositions of graphs with bounded gonality . ArXiV e-prints, arXiv:2005.05569 (2020)","DOI":"10.1007\/978-3-030-58150-3_31"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1016\/j.aim.2012.02.019","volume":"230","author":"F Cools","year":"2012","unstructured":"Cools, F., Draisma, J., Payne, S., Robeva, E.: A tropical proof of the Brill-Noether theorem. Adv. Math. 230(2), 759\u2013776 (2012)","journal-title":"Adv. Math."},{"issue":"1\u20132","key":"31_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s00208-014-1067-x","volume":"361","author":"G Cornelissen","year":"2015","unstructured":"Cornelissen, G., Kato, F., Kool, J.: A combinatorial Li-Yau inequality and rational points on curves. Math. Ann. 361(1\u20132), 211\u2013258 (2015)","journal-title":"Math. Ann."},{"issue":"14","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1103\/PhysRevLett.64.1613","volume":"64","author":"D Dhar","year":"1990","unstructured":"Dhar, D.: Self-organized critical state of sandpile automaton models. Phys. Rev. Lett. 64(14), 1613 (1990)","journal-title":"Phys. Rev. Lett."},{"key":"31_CR10","unstructured":"van Dobben de Bruyn, J., Gijswijt, D.: Treewidth is a lower bound on graph gonality . ArXiV e-prints, arXiv:1407.7055v2 (2014)"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1137\/16M1095329","volume":"32","author":"K Hendrey","year":"2018","unstructured":"Hendrey, K.: Sparse graphs of high gonality. SIAM J. Discrete Math. 32(2), 1400\u20131407 (2018)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"31_CR12","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(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a minimax theorem for tree-width. J. Comb. Theor. Ser. B 58, 239\u2013257 (1993)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"31_CR14","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1017\/S0017089500030019","volume":"42","author":"H Urakawa","year":"2000","unstructured":"Urakawa, H.: A discrete analogue of the harmonic morphism and Green kernel comparison theorems. Glasgow Math. J. 42(3), 319\u2013334 (2000)","journal-title":"Glasgow Math. J."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:40:55Z","timestamp":1619242855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_31","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":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.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":"10.2","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":"No","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)"}}]}}