{"id":"https://openalex.org/W4376651369","doi":"https://doi.org/10.1145/3564246.3585245","title":"An Improved Parameterized Algorithm for Treewidth","display_name":"An Improved Parameterized Algorithm for Treewidth","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376651369","doi":"https://doi.org/10.1145/3564246.3585245"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585245","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585245","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585245","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585245","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080387266","display_name":"Tuukka Korhonen","orcid":"https://orcid.org/0000-0003-0861-6515"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Tuukka Korhonen","raw_affiliation_strings":["University of Bergen, Norway, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bergen, Norway, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California at Santa Barbara, Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"528","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9240416288375854},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7989145517349243},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.593120276927948},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5798983573913574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.526054859161377},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4810074269771576},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.46770498156547546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4440550208091736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42768359184265137},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42142486572265625},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4172661602497101},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4046935439109802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39208924770355225},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2841876745223999},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19146376848220825},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.17786747217178345}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9240416288375854},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7989145517349243},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.593120276927948},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5798983573913574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.526054859161377},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4810074269771576},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.46770498156547546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4440550208091736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42768359184265137},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42142486572265625},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4172661602497101},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4046935439109802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39208924770355225},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2841876745223999},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19146376848220825},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.17786747217178345},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585245","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585245","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585245","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585245","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585245","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585245","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5399623649","display_name":null,"funder_award_id":"314528","funder_id":"https://openalex.org/F4320323299","funder_display_name":"Norges Forskningsr\u00e5d"},{"id":"https://openalex.org/G8165359859","display_name":null,"funder_award_id":"CCF-2008838","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8597347167","display_name":"AF: Small: Algorithms meet Structural Graph Decomposition","funder_award_id":"2008838","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323299","display_name":"Norges Forskningsr\u00e5d","ror":"https://ror.org/00epmv149"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4376651369.pdf"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W1587078595","https://openalex.org/W1636203894","https://openalex.org/W1968041356","https://openalex.org/W1973972417","https://openalex.org/W1983860528","https://openalex.org/W2002722727","https://openalex.org/W2005079828","https://openalex.org/W2008440715","https://openalex.org/W2010600799","https://openalex.org/W2023039219","https://openalex.org/W2024291212","https://openalex.org/W2027562075","https://openalex.org/W2028357390","https://openalex.org/W2055916047","https://openalex.org/W2059372025","https://openalex.org/W2066867008","https://openalex.org/W2067016370","https://openalex.org/W2076164610","https://openalex.org/W2085550081","https://openalex.org/W2086937160","https://openalex.org/W2098879666","https://openalex.org/W2115666768","https://openalex.org/W2119468705","https://openalex.org/W2125058377","https://openalex.org/W2151617868","https://openalex.org/W2159003936","https://openalex.org/W2313886575","https://openalex.org/W2909144890","https://openalex.org/W2914414140","https://openalex.org/W2997728797","https://openalex.org/W3092196786","https://openalex.org/W3150373505","https://openalex.org/W4206641069","https://openalex.org/W4220653067","https://openalex.org/W4230551286","https://openalex.org/W4309133979","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1572255008","https://openalex.org/W1539278744","https://openalex.org/W1576158606","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W1594588516","https://openalex.org/W2949315077"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,8,13],"algorithm":[3,52,58,77],"that":[4],"takes":[5],"as":[6],"input":[7],"n-vertex":[9],"graph":[10],"G":[11,27],"and":[12,21,81,85,87],"integer":[14],"k,":[15,32],"runs":[16],"in":[17,68],"time":[18,51,76],"2O(k2)":[19],"nO(1),":[20],"outputs":[22],"a":[23,35,48],"tree":[24],"decomposition":[25,36],"of":[26,28,44],"width":[29],"at":[30],"most":[31],"if":[33],"such":[34],"exists.":[37],"This":[38],"resolves":[39],"the":[40,60,64,73],"long-standing":[41],"open":[42],"problem":[43],"whether":[45],"there":[46],"is":[47,59],"2o(k3)":[49],"nO(1)":[50,75],"for":[53,70],"treewidth.":[54],"In":[55],"particular,":[56],"our":[57],"first":[61],"improvement":[62],"on":[63,66],"dependency":[65],"k":[67],"algorithms":[69],"treewidth":[71],"since":[72],"2O(k3)":[74],"given":[78],"by":[79],"Bodlaender":[80],"Kloks":[82],"[ICALP":[83,89],"1991]":[84],"Lagergren":[86],"Arnborg":[88],"1991].":[90]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}