{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:46:43Z","timestamp":1781077603542,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Research Council of Norway","award":["314528"],"award-info":[{"award-number":["314528"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2008838"],"award-info":[{"award-number":["CCF-2008838"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585245","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"528-541","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["An Improved Parameterized Algorithm for Treewidth"],"prefix":"10.1145","author":[{"given":"Tuukka","family":"Korhonen","sequence":"first","affiliation":[{"name":"University of Bergen, Norway, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[{"name":"University of California at Santa Barbara, Santa Barbara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2074022.2074024"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9180-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0608024"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92681-6_23"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00593"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548302005369"},{"key":"e_1_3_2_1_7_1","volume-title":"Nonserial dynamic programming","author":"Bertel\u00e8 Umberto","unstructured":"Umberto Bertel\u00e8 and Francesco Brioschi . 1972. Nonserial dynamic programming . Academic Press , New York . Mathematics in Science and Engineering, Vol. 91 Umberto Bertel\u00e8 and Francesco Brioschi. 1972. Nonserial dynamic programming. Academic Press, New York. Mathematics in Science and Engineering, Vol. 91"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167161"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"Bodlaender H. L.","year":"1993","unstructured":"H. L. Bodlaender . 1993 . A tourist guide through treewidth . Acta Cybernet. , 11 , 1 - 2 (1993), 1\u201321. H. L. Bodlaender. 1993. A tourist guide through treewidth. Acta Cybernet., 11, 1-2 (1993), 1\u201321.","journal-title":"Acta Cybernet."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90018-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793251219"},{"key":"e_1_3_2_1_12_1","volume-title":"Jan Arne Telle, and D\u00e1niel Marx","author":"Bodlaender Hans L","year":"2006","unstructured":"Hans L Bodlaender , Leizhen Cai , Jianer Chen , Michael R. Fellows , Jan Arne Telle, and D\u00e1niel Marx . 2006 . Open problems in parameterized and exact computation \u2013 IWPEC 2006. Department of Information and Computing Sciences, Utrecht University . Hans L Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, and D\u00e1niel Marx. 2006. Open problems in parameterized and exact computation \u2013 IWPEC 2006. Department of Information and Computing Sciences, Utrecht University."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/130947374"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1995.1009"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-021-10030-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54233-7_162"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0049"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.017"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758777"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9130-6"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90043-H"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_23_1","volume-title":"Graph theory","author":"Diestel Reinhard","unstructured":"Reinhard Diestel . 2005. Graph theory ( 3 rd ed.) (Graduate Texts in Mathematics , Vol. 173). Springer-Verlag, Berlin. isbn:978-3-540-26182-7; 3-540-26182-6; 978-3-540-26183- 4 Reinhard Diestel. 2005. Graph theory (3rd ed.) (Graduate Texts in Mathematics, Vol. 173). Springer-Verlag, Berlin. isbn:978-3-540-26182-7; 3-540-26182-6; 978-3-540-26183-4","edition":"3"},{"key":"e_1_3_2_1_24_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"1999","unstructured":"Rodney G. Downey and Michael R . Fellows . 1999 . Parameterized complexity. Springer-Verlag , New York. Rodney G. Downey and Michael R. Fellows. 1999. Parameterized complexity. Springer-Verlag, New York."},{"key":"e_1_3_2_1_25_1","volume-title":"Fellows","author":"Downey Rodney G.","year":"2013","unstructured":"Rodney G. Downey and Michael R . Fellows . 2013 . Fundamentals of Parameterized Complexity. Springer . Rodney G. Downey and Michael R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/05064299X"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). ACM, 501\u2013512","author":"Michael","unstructured":"Michael R. Fellows and Michael A. Langston. 1989. On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) . In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). ACM, 501\u2013512 . Michael R. Fellows and Michael A. Langston. 1989. On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). ACM, 501\u2013512."},{"key":"e_1_3_2_1_29_1","volume-title":"Parameterized Complexity Theory","author":"Flum J\u00f6rg","unstructured":"J\u00f6rg Flum and Martin Grohe . 2006. Parameterized Complexity Theory . Springer-Verlag , Berlin . isbn:3540299521 J\u00f6rg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer-Verlag, Berlin. isbn:3540299521"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186898"},{"key":"e_1_3_2_1_31_1","volume-title":"Kernelization: Theory of parameterized preprocessing","author":"Fomin Fedor V","year":"2019","unstructured":"Fedor V Fomin , Daniel Lokshtanov , Saket Saurabh , and Meirav Zehavi . 2019 . Kernelization: Theory of parameterized preprocessing . Cambridge University Press . Fedor V Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. 2019. Kernelization: Theory of parameterized preprocessing. Cambridge University Press."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/140964801"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01917434"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00026"},{"key":"e_1_3_2_1_35_1","volume-title":"An Improved Parameterized Algorithm for Treewidth. CoRR, abs\/2211.07154","author":"Korhonen Tuukka","year":"2022","unstructured":"Tuukka Korhonen and Daniel Lokshtanov . 2022. An Improved Parameterized Algorithm for Treewidth. CoRR, abs\/2211.07154 ( 2022 ), https:\/\/doi.org\/10.48550\/arXiv.2211.07154 arXiv:2211.07154. 10.48550\/arXiv.2211.07154 Tuukka Korhonen and Daniel Lokshtanov. 2022. An Improved Parameterized Algorithm for Treewidth. CoRR, abs\/2211.07154 (2022), https:\/\/doi.org\/10.48550\/arXiv.2211.07154 arXiv:2211.07154."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0002"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54233-7_161"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90020-Y"},{"key":"e_1_3_2_1_39_1","volume-title":"Invitation to fixed-parameter algorithms (Oxford Lecture Series in Mathematics and its Applications","author":"Niedermeier Rolf","unstructured":"Rolf Niedermeier . 2006. Invitation to fixed-parameter algorithms (Oxford Lecture Series in Mathematics and its Applications , Vol. 31). Oxford University Press, Oxford. isbn:978-0-19-856607-6; 0-19-856607- 7 Rolf Niedermeier. 2006. Invitation to fixed-parameter algorithms (Oxford Lecture Series in Mathematics and its Applications, Vol. 31). Oxford University Press, Oxford. isbn:978-0-19-856607-6; 0-19-856607-7"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129734"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2655713.2655729"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585245","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585245","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585245","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:02Z","timestamp":1750178822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585245"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":44,"alternative-id":["10.1145\/3564246.3585245","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585245","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}