{"id":"https://openalex.org/W2313886575","doi":"https://doi.org/10.1137/130947374","title":"A $c^k n$ 5-Approximation Algorithm for Treewidth","display_name":"A $c^k n$ 5-Approximation Algorithm for Treewidth","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2313886575","doi":"https://doi.org/10.1137/130947374","mag":"2313886575"},"language":"en","primary_location":{"id":"doi:10.1137/130947374","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130947374","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/331033","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Utrecht University"],"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064442594","display_name":"P\u00e5l Gr\u00f8n\u00e5s Drange","orcid":"https://orcid.org/0000-0001-7228-6640"},"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":"P\u00e5l Gr\u01ffn\u00e5s Drange","raw_affiliation_strings":["University Of Bergen;"],"affiliations":[{"raw_affiliation_string":"University Of Bergen;","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006971800","display_name":"Markus Sortland Dregi","orcid":null},"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":"Markus S. Dregi","raw_affiliation_strings":["University Of Bergen;"],"affiliations":[{"raw_affiliation_string":"University Of Bergen;","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"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":"Fedor V. Fomin","raw_affiliation_strings":["University Of Bergen;"],"affiliations":[{"raw_affiliation_string":"University Of Bergen;","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"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":"Daniel Lokshtanov","raw_affiliation_strings":["University Of Bergen;"],"affiliations":[{"raw_affiliation_string":"University Of Bergen;","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":27.8174,"has_fulltext":false,"cited_by_count":200,"citation_normalized_percentile":{"value":0.99701898,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"45","issue":"2","first_page":"317","last_page":"378"},"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.9998000264167786,"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.9965000152587891,"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.949675440788269},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7481187582015991},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6399092078208923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6002416610717773},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5385066270828247},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5207859873771667},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5049052834510803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4786587655544281},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.4621705412864685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4583546221256256},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4379117786884308},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4278591275215149},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.380515456199646},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3564451336860657},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.30339348316192627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20339587330818176},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.15478789806365967},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08367639780044556}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.949675440788269},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7481187582015991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6399092078208923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6002416610717773},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5385066270828247},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5207859873771667},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5049052834510803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4786587655544281},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.4621705412864685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4583546221256256},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4379117786884308},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4278591275215149},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.380515456199646},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3564451336860657},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.30339348316192627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20339587330818176},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.15478789806365967},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08367639780044556},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1137/130947374","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130947374","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.416.8778","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.8778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~daniello/papers/treewidthApprox.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.769.5494","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.769.5494","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1304.6321.pdf","raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/f3163f01-b9f1-4dc4-85e8-9e2dc29954e1","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f3163f01-b9f1-4dc4-85e8-9e2dc29954e1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bodlaender, H L, Drange, P G, Dregi, M S, Fomin, F V, Lokshtanov, D & Pilipczuk, M 2016, 'A c \u03ba n 5-Approximation algorithm for treewidth', SIAM Journal on Computing, vol. 45, no. 2, pp. 317-378. https://doi.org/10.1137/130947374","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/f3163f01-b9f1-4dc4-85e8-9e2dc29954e1","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=84964846572&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bodlaender, H L, Drange, P G, Dregi, M S, Fomin, F V, Lokshtanov, D & Pilipczuk, M 2016, 'A c \u03ba n 5-Approximation algorithm for treewidth', SIAM Journal on Computing, vol. 45, no. 2, pp. 317-378. https://doi.org/10.1137/130947374","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/f3163f01-b9f1-4dc4-85e8-9e2dc29954e1","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/f3163f01-b9f1-4dc4-85e8-9e2dc29954e1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 45(2), 317 - 378. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/331033","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/331033","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 45(2), 317. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/331033","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/331033","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 45(2), 317. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2922961251","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G3413111253","display_name":null,"funder_award_id":"NETWORKS","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G5440510009","display_name":null,"funder_award_id":"Beating Hardness by Preprocessing","funder_id":"https://openalex.org/F4320323898","funder_display_name":"Bergens Forskningsstiftelse"},{"id":"https://openalex.org/G72107327","display_name":null,"funder_award_id":"267959","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1972515959","https://openalex.org/W1973972417","https://openalex.org/W2005079828","https://openalex.org/W2010600799","https://openalex.org/W2017492235","https://openalex.org/W2027562075","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2035796100","https://openalex.org/W2037233409","https://openalex.org/W2047153806","https://openalex.org/W2048362350","https://openalex.org/W2059372025","https://openalex.org/W2067264828","https://openalex.org/W2071362870","https://openalex.org/W2076164610","https://openalex.org/W2080959483","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2121641644","https://openalex.org/W2125058377","https://openalex.org/W2127485201","https://openalex.org/W2140465653","https://openalex.org/W2158584754"],"related_works":["https://openalex.org/W1539278744","https://openalex.org/W2091382007","https://openalex.org/W2143406303","https://openalex.org/W1485639265","https://openalex.org/W2111290740","https://openalex.org/W2223243427","https://openalex.org/W186753374","https://openalex.org/W2949199930","https://openalex.org/W2949940357","https://openalex.org/W143512583"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,6],"algorithm":[3,48,76],"that":[4,21],"for":[5,54],"input":[7,101],"n-vertex":[8],"graph":[9],"G":[10,25,36],"and":[11,64,97],"integer":[12],"\u03ba":[13,63],">":[14],"0,":[15],"in":[16,58,62,66,88,94,99],"time":[17,59,89],"2O(\u03ba)n,":[18],"either":[19],"outputs":[20],"the":[22,46,95,100],"treewidth":[23,55,96],"of":[24,35,37,72],"is":[26,45,91],"larger":[27],"than":[28],"\u03ba,":[29],"or":[30],"gives":[31],"a":[32,50],"tree":[33],"decomposition":[34],"width":[38],"at":[39],"most":[40],"5\u03ba":[41],"+":[42],"4.":[43],"This":[44],"first":[47],"providing":[49],"constant":[51],"factor":[52],"approximation":[53],"which":[56,90],"runs":[57],"single":[60,92],"exponential":[61,93],"linear":[65,98],"n.":[67],"Treewidth-based":[68],"computations":[69],"are":[70],"subroutines":[71],"numerous":[73],"algorithms.":[74],"Our":[75],"can":[77],"be":[78],"used":[79],"to":[80,86],"speed":[81],"up":[82],"many":[83],"such":[84],"algorithms":[85],"work":[87],"size.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":16},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":27},{"year":2020,"cited_by_count":29},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":48},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}