{"id":"https://openalex.org/W2021180976","doi":"https://doi.org/10.1093/comjnl/bxm037","title":"Combinatorial Optimization on Graphs of Bounded Treewidth","display_name":"Combinatorial Optimization on Graphs of Bounded Treewidth","publication_year":2007,"publication_date":"2007-07-19","ids":{"openalex":"https://openalex.org/W2021180976","doi":"https://doi.org/10.1093/comjnl/bxm037","mag":"2021180976"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxm037","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm037","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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":false,"raw_author_name":"H. L. Bodlaender","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, PO Box 80.089, 3508 TB Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043443150","display_name":"Arie M. C. A. Koster","orcid":"https://orcid.org/0000-0002-8035-7012"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. M. C. A. Koster","raw_affiliation_strings":["Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry CV4 7AL, UK","Centre for Discrete Mathematics and its Applications DIMAP, University of Warwick , Coventry, CV4 7AL, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]},{"raw_affiliation_string":"Centre for Discrete Mathematics and its Applications DIMAP, University of Warwick , Coventry, CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":19.8835,"has_fulltext":false,"cited_by_count":296,"citation_normalized_percentile":{"value":0.99644041,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"51","issue":"3","first_page":"255","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.996399998664856,"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.9076602458953857},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5920616388320923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5287840962409973},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47539958357810974},{"id":"https://openalex.org/keywords/library-science","display_name":"Library science","score":0.39508312940597534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3717082142829895},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32682931423187256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32168012857437134},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26867449283599854},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.12222352623939514}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9076602458953857},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5920616388320923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5287840962409973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47539958357810974},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.39508312940597534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3717082142829895},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32682931423187256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32168012857437134},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26867449283599854},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.12222352623939514},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1093/comjnl/bxm037","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxm037","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.2561","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.2561","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://comjnl.oxfordjournals.org/cgi/reprint/bxm037v1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":94,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W88635354","https://openalex.org/W104370704","https://openalex.org/W143512583","https://openalex.org/W200045149","https://openalex.org/W1506542774","https://openalex.org/W1517036688","https://openalex.org/W1517074594","https://openalex.org/W1551907897","https://openalex.org/W1555478065","https://openalex.org/W1559538863","https://openalex.org/W1566343863","https://openalex.org/W1570425181","https://openalex.org/W1593793857","https://openalex.org/W1593916827","https://openalex.org/W1628915153","https://openalex.org/W1818617877","https://openalex.org/W1850475437","https://openalex.org/W1934849835","https://openalex.org/W1973310391","https://openalex.org/W1973347908","https://openalex.org/W1973972417","https://openalex.org/W1974473207","https://openalex.org/W1978452004","https://openalex.org/W1980452149","https://openalex.org/W1982180670","https://openalex.org/W1983156760","https://openalex.org/W1983860528","https://openalex.org/W1985773538","https://openalex.org/W1989556004","https://openalex.org/W1991477862","https://openalex.org/W1991755800","https://openalex.org/W1993522985","https://openalex.org/W1995675321","https://openalex.org/W1999038767","https://openalex.org/W1999061527","https://openalex.org/W2003021478","https://openalex.org/W2003998639","https://openalex.org/W2010600799","https://openalex.org/W2012154006","https://openalex.org/W2012951995","https://openalex.org/W2013967419","https://openalex.org/W2016056456","https://openalex.org/W2018876684","https://openalex.org/W2019137761","https://openalex.org/W2027566319","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2033325972","https://openalex.org/W2033405938","https://openalex.org/W2034501206","https://openalex.org/W2037106315","https://openalex.org/W2038643780","https://openalex.org/W2043791970","https://openalex.org/W2047033531","https://openalex.org/W2047871605","https://openalex.org/W2049609719","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2066904980","https://openalex.org/W2067016370","https://openalex.org/W2067264828","https://openalex.org/W2067380255","https://openalex.org/W2067692416","https://openalex.org/W2080959483","https://openalex.org/W2085367693","https://openalex.org/W2085550081","https://openalex.org/W2086119402","https://openalex.org/W2087083200","https://openalex.org/W2092119436","https://openalex.org/W2098854122","https://openalex.org/W2103080151","https://openalex.org/W2104739701","https://openalex.org/W2111290740","https://openalex.org/W2113658811","https://openalex.org/W2118348318","https://openalex.org/W2122238039","https://openalex.org/W2125547222","https://openalex.org/W2125720043","https://openalex.org/W2127485201","https://openalex.org/W2135382359","https://openalex.org/W2143474538","https://openalex.org/W2151120603","https://openalex.org/W2151617868","https://openalex.org/W2151721933","https://openalex.org/W2155920587","https://openalex.org/W2156760067","https://openalex.org/W2157362754","https://openalex.org/W2165094933","https://openalex.org/W2174973502","https://openalex.org/W2799004609","https://openalex.org/W2913688336","https://openalex.org/W2919648183","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2964174631","https://openalex.org/W1810116456","https://openalex.org/W4300619607","https://openalex.org/W4321393130","https://openalex.org/W2736575577","https://openalex.org/W2178269805","https://openalex.org/W1579590954","https://openalex.org/W2223243427","https://openalex.org/W4306887989","https://openalex.org/W2951811902"],"abstract_inverted_index":{"There":[0],"are":[1,115],"many":[2],"graph":[3,22],"problems":[4],"that":[5,83,90],"can":[6],"be":[7],"solved":[8],"in":[9],"linear":[10],"or":[11,92,101],"polynomial":[12],"time":[13],"with":[14,59,99],"a":[15,32],"dynamic":[16],"programming":[17],"algorithm":[18],"when":[19],"the":[20,48,57,60,73],"input":[21],"has":[23],"bounded":[24],"treewidth.":[25,105],"For":[26],"combinatorial":[27],"optimization":[28],"problems,":[29],"this":[30],"is":[31],"useful":[33],"approach":[34],"for":[35,107,112],"obtaining":[36],"fixed-parameter":[37],"tractable":[38],"algorithms.":[39],"Starting":[40],"from":[41],"trees":[42],"and":[43,52,55,87,95,110],"series-parallel":[44],"graphs,":[45],"we":[46],"introduce":[47],"concepts":[49],"of":[50,72],"treewidth":[51,94],"tree":[53,85,97],"decompositions,":[54,86],"illustrate":[56],"technique":[58],"Weighted":[61],"Independent":[62],"Set":[63],"problem":[64],"as":[65],"an":[66,77],"example.":[67],"The":[68],"paper":[69],"surveys":[70],"some":[71],"latest":[74],"developments,":[75],"putting":[76],"emphasis":[78],"on":[79,81,88],"applicability,":[80],"algorithms":[82,89],"exploit":[84],"determine":[91],"approximate":[93],"find":[96],"decompositions":[98],"optimal":[100,104],"close":[102],"to":[103],"Directions":[106],"further":[108,113],"research":[109],"suggestions":[111],"reading":[114],"also":[116],"given.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":14},{"year":2018,"cited_by_count":23},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":20},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":21}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}