{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:06:45Z","timestamp":1742940405874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031433795"},{"type":"electronic","value":"9783031433801"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43380-1_14","type":"book-chapter","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T20:29:12Z","timestamp":1695414552000},"page":"187-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Snakes and\u00a0Ladders: A Treewidth Story"],"prefix":"10.1007","author":[{"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Kelk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Meuwese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Stamoulis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-031-21534-6_6","volume-title":"Algorithms for Big Data","author":"FN Abu-Khzam","year":"2022","unstructured":"Abu-Khzam, F.N., Lamm, S., Mnich, M., Noe, A., Schulz, C., Strash, D.: Recent advances in practical data reduction. In: Bast, H., Korzen, C., Meyer, U., Penschuck, M. (eds.) Algorithms for Big Data. LNCS, vol. 13201, pp. 97\u2013133. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21534-6_6"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B Allen","year":"2001","unstructured":"Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5, 1\u201315 (2001)","journal-title":"Ann. Comb."},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Blair, J., Peyton, B.: Graph Theory and Sparse Matrix Computation, chap. An Introduction to Chordal Graphs and Clique Trees. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Applications, vol. 56, pp. 1\u201329. Springer, New York (1993). https:\/\/doi.org\/10.1007\/978-1-4613-8369-7_1","DOI":"10.1007\/978-1-4613-8369-7_1"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/inco.2000.2958","volume":"167","author":"HL Bodlaender","year":"2001","unstructured":"Bodlaender, H.L., van Antwerpen-de Fluiter, B.: Reduction algorithms for graphs of small treewidth. Inf. Comput. 167(2), 86\u2013119 (2001)","journal-title":"Inf. Comput."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (meta) kernelization. J. ACM 63(5), 44:1\u201344:69 (2016)","DOI":"10.1145\/2973749"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.tcs.2005.10.033","volume":"351","author":"D Bryant","year":"2006","unstructured":"Bryant, D., Lagergren, J.: Compatibility of unrooted phylogenetic trees is FPT. Theoret. Comput. Sci. 351(3), 296\u2013302 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"12","key":"14_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.3390\/a12120256","volume":"12","author":"L Bulteau","year":"2019","unstructured":"Bulteau, L., Weller, M.: Parameterized algorithms in bioinformatics: an overview. Algorithms 12(12), 256 (2019)","journal-title":"Algorithms"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Chaplick, S., Kelk, S., Meuwese, R., Mihalak, M., Stamoulis, G.: Snakes and ladders: a treewidth story. arXiv preprint arXiv:2302.10662 (2023)","DOI":"10.1007\/978-3-031-43380-1_14"},{"key":"14_CR9","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"key":"14_CR10","unstructured":"van Iersel, L., Jones, M., Weller, M.: Embedding phylogenetic trees in networks of low treewidth. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, September 5\u20139, 2022, Berlin\/Potsdam, Germany. LIPIcs, vol. 244, pp. 69:1\u201369:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). arXiv preprint arXiv:2207.00574"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"715","DOI":"10.7155\/jgaa.00508","volume":"23","author":"R Janssen","year":"2019","unstructured":"Janssen, R., Jones, M., Kelk, S., Stamoulis, G., Wu, T.: Treewidth of display graphs: bounds, brambles and applications. J. Graph Algorithms Appl. 23(4), 715\u2013743 (2019)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"14_CR12","volume":"66","author":"KS John","year":"2017","unstructured":"John, K.S.: The shape of phylogenetic treespace. Syst. Biol. 66(1), e83 (2017)","journal-title":"Syst. Biol."},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.7155\/jgaa.00390","volume":"20","author":"S Kelk","year":"2016","unstructured":"Kelk, S., van Iersel, L., Scornavacca, C., Weller, M.: Phylogenetic incongruence through the lens of monadic second order logic. J. Graph Algorithms Appl. 20(2), 189\u2013215 (2016)","journal-title":"J. Graph Algorithms Appl."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2018.04.004","volume":"731","author":"S Kelk","year":"2018","unstructured":"Kelk, S., Stamoulis, G., Wu, T.: Treewidth distance on phylogenetic trees. Theoret. Comput. Sci. 731, 99\u2013117 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1137\/S0895480193243043","volume":"9","author":"D Sanders","year":"1996","unstructured":"Sanders, D.: On linear recognition of tree-width at most four. SIAM J. Discret. Math. 9(1), 101\u2013117 (1996)","journal-title":"SIAM J. Discret. Math."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Steel, M.: Phylogeny: Discrete and Random Processes in Evolution. SIAM (2016)","DOI":"10.1137\/1.9781611974485"}],"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-031-43380-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T11:57:31Z","timestamp":1703246251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43380-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031433795","9783031433801"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43380-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 September 2023","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":"Fribourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.unifr.ch\/wg2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}