{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:57:03Z","timestamp":1743037023642,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030420703"},{"type":"electronic","value":"9783030420710"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42071-0_14","type":"book-chapter","created":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T17:02:44Z","timestamp":1587574964000},"page":"189-213","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Tree Decompositions"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"Pilipczuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Discrete Math. 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^k n$$$$5$$-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-54233-7_162","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1991","unstructured":"Bodlaender, H.L., Kloks, T.: Better algorithms for the pathwidth and treewidth of graphs. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 544\u2013555. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54233-7_162"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L., Kloks, T.: Efficient and constructive algorithms for the pathwidth and treewidth of graphs. J. Algorithms 21(2), 358\u2013402 (1996)","journal-title":"J. Algorithms"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/3-540-63165-8_217","volume-title":"Automata, Languages and Programming","author":"HL Bodlaender","year":"1997","unstructured":"Bodlaender, H.L., Thilikos, D.M.: Constructive linear time algorithms for branchwidth. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 627\u2013637. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63165-8_217"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Pilipczuk, M.: Definability equals recognizability for graphs of bounded treewidth. CoRR, abs\/1605.03045 (2016). Extended abstract published in the proceedings of LICS 2016","DOI":"10.1145\/2933575.2934508"},{"key":"14_CR8","unstructured":"Boja\u0144czyk, M., Pilipczuk, M.: Optimizing tree decompositions in MSO. In: Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. LIPIcs, vol. 66, pp. 15:1\u201315:13. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1017\/S096012950000092X","volume":"6","author":"B Courcelle","year":"1996","unstructured":"Courcelle, B., Lagergren, J.: Equivalent definitions of recognizability for sets of graphs of bounded tree-width. Math. Struct. Comput. Sci. 6(2), 141\u2013165 (1996)","journal-title":"Math. Struct. Comput. Sci."},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"14_CR11","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, LIPIcs, vol. 89, pp. 30:1\u201330:12. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3132720","volume":"9","author":"M Elberfeld","year":"2017","unstructured":"Elberfeld, M., Schweitzer, P.: Canonizing graphs of bounded tree width in logspace. ACM Trans. Comput. Theory (TOCT) 9(3), 1\u201329 (2017)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629\u2013657 (2008)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1145\/602220.602222","volume":"49","author":"J Flum","year":"2002","unstructured":"Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM 49(6), 716\u2013752 (2002)","journal-title":"J. ACM"},{"key":"14_CR15","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"issue":"2","key":"14_CR16","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00453-018-0424-7","volume":"81","author":"AC Giannopoulou","year":"2019","unstructured":"Giannopoulou, A.C., Pilipczuk, M., Raymond, J., Thilikos, D.M., Wrochna, M.: Cutwidth: obstructions and algorithmic aspects. Algorithmica 81(2), 557\u2013588 (2019)","journal-title":"Algorithmica"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Jeong, J., Kim, E.J., Oum, S.I.: Constructive algorithm for path-width of matroids. In: Krauthgamer, R. (ed.) Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 1695\u20131704. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch116"},{"key":"14_CR18","unstructured":"Jeong, J., Kim, E.J., Oum, S.: Finding branch-decompositions of matroids, hypergraphs, and more. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. LIPIcs, vol. 107, pp. 80:1\u201380:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"14_CR19","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Algorithm Design. Addison-Wesley (2006)"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1006\/jctb.1997.1788","volume":"73","author":"J Lagergren","year":"1998","unstructured":"Lagergren, J.: Upper bounds on the size of obstructions and intertwines. J. Comb. Theory Ser. B 73(1), 7\u201340 (1998)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/3-540-54233-7_161","volume-title":"Automata, Languages and Programming","author":"J Lagergren","year":"1991","unstructured":"Lagergren, J., Arnborg, S.: Finding minimal forbidden minors using a finite congruence. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds.) ICALP 1991. LNCS, vol. 510, pp. 532\u2013543. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54233-7_161"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1137\/140999980","volume":"46","author":"D Lokshtanov","year":"2017","unstructured":"Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM J. Comput. 46(1), 161\u2013189 (2017)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S Oum","year":"2006","unstructured":"Oum, S., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96(4), 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Raghavendra, P., Steurer, D.: Graph expansion and the unique games conjecture. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp. 755\u2013764. ACM (2010)","DOI":"10.1145\/1806689.1806792"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Reed, B.A.: Finding approximate separators and computing tree width quickly. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 221\u2013228. ACM (1992)","DOI":"10.1145\/129712.129734"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65\u2013110 (1995)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. J. Comb. Theory Ser. B 92(2), 325\u2013357 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-40996-3_17","volume-title":"Algorithms and Computation","author":"DM Thilikos","year":"2000","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Constructive linear time algorithms for small cutwidth and carving-width. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 192\u2013203. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-40996-3_17"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2004.12.001","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth I: a linear time fixed parameter algorithm. J. Algorithms 56(1), 1\u201324 (2005)","journal-title":"J. Algorithms"},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jalgor.2004.12.003","volume":"56","author":"DM Thilikos","year":"2005","unstructured":"Thilikos, D.M., Serna, M.J., Bodlaender, H.L.: Cutwidth II: algorithms for partial $$w$$-trees of bounded degree. J. Algorithms 56(1), 25\u201349 (2005)","journal-title":"J. Algorithms"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1613\/jair.4030","volume":"49","author":"Y Wu","year":"2014","unstructured":"Wu, Y., Austrin, P., Pitassi, T., Liu, D.: Inapproximability of treewidth and related problems. J. Artif. Intell. Res. 49, 569\u2013600 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"14_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM J. Algebr. Discrete Methods 2(1), 77\u201379 (1981)","journal-title":"SIAM J. Algebr. Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Treewidth, Kernels, and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42071-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,18]],"date-time":"2022-12-18T14:03:44Z","timestamp":1671372224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-42071-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030420703","9783030420710"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42071-0_14","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":"20 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}