{"id":"https://openalex.org/W2104739701","doi":"https://doi.org/10.1007/11841036_60","title":"On Exact Algorithms for Treewidth","display_name":"On Exact Algorithms for Treewidth","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2104739701","doi":"https://doi.org/10.1007/11841036_60","mag":"2104739701"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_60","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_60","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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":"Hans L. Bodlaender","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"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":["Department of Informatics, University of Bergen, N-5020, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, N-5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","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/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Arie M. C. A. Koster","raw_affiliation_strings":["Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustra\u00dfe 7, D-14195, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Takustra\u00dfe 7, D-14195, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109894460","display_name":"Dieter Kratsch","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter Kratsch","raw_affiliation_strings":["LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LITA, Universit\u00e9 Paul Verlaine \u2013 Metz, 57045 Cedex 01, Metz, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085447779","display_name":"Dimitrios M. Thilikos","orcid":"https://orcid.org/0000-0003-0470-1800"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Dimitrios M. Thilikos","raw_affiliation_strings":["Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya, Edifici \u03a9, c/ Jordi Girona 1-3, E-08034, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Llenguatges i Sistemes Inform\u00e0tics, Universitat Polit\u00e8cnica de Catalunya, Edifici \u03a9, c/ Jordi Girona 1-3, E-08034, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.0046,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.96267802,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"672","last_page":"683"},"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.994700014591217,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.9040526151657104},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7025424242019653},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5943643450737},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.578126072883606},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5415475964546204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5391119122505188},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5205796360969543},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5167126059532166},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4995269775390625},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4698048233985901},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4118436574935913},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39892199635505676},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33213332295417786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26197928190231323},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2559703290462494},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22696146368980408},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1745055615901947},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.1661706566810608},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08137056231498718}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9040526151657104},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7025424242019653},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5943643450737},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.578126072883606},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5415475964546204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5391119122505188},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5205796360969543},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5167126059532166},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4995269775390625},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4698048233985901},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4118436574935913},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39892199635505676},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33213332295417786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26197928190231323},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2559703290462494},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22696146368980408},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1745055615901947},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1661706566810608},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08137056231498718},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11841036_60","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_60","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1551907897","https://openalex.org/W1569612812","https://openalex.org/W1582963151","https://openalex.org/W1584965761","https://openalex.org/W1593916827","https://openalex.org/W1628915153","https://openalex.org/W1969186119","https://openalex.org/W1985733932","https://openalex.org/W2010030994","https://openalex.org/W2012473793","https://openalex.org/W2030087828","https://openalex.org/W2052867211","https://openalex.org/W2072099942","https://openalex.org/W2079966248","https://openalex.org/W2085550081","https://openalex.org/W2086119402","https://openalex.org/W2087083200","https://openalex.org/W2089465933","https://openalex.org/W2098854122","https://openalex.org/W2103080151","https://openalex.org/W2111930185","https://openalex.org/W2113658811","https://openalex.org/W2118348318","https://openalex.org/W2125547222","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W2914617426","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1572255008","https://openalex.org/W1576158606","https://openalex.org/W1539278744","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W1594588516","https://openalex.org/W2949315077"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}