{"id":"https://openalex.org/W1973972417","doi":"https://doi.org/10.1007/s00453-008-9180-4","title":"Approximation Algorithms for Treewidth","display_name":"Approximation Algorithms for Treewidth","publication_year":2008,"publication_date":"2008-04-01","ids":{"openalex":"https://openalex.org/W1973972417","doi":"https://doi.org/10.1007/s00453-008-9180-4","mag":"1973972417"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9180-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9180-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5109409885","display_name":"Eyal Amir","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Eyal Amir","raw_affiliation_strings":["Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA","University of Illinois at Urbana-Champaign, Computer Science Department, 61801, Urbana, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Illinois at Urbana-Champaign, Urbana, IL, 61801, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Computer Science Department, 61801, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109409885"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.7938,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.95944853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"56","issue":"4","first_page":"448","last_page":"479"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.9937999844551086,"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.9169481992721558},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.7881098985671997},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7502158880233765},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7165689468383789},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.6637064218521118},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.597938060760498},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5675469040870667},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5486541390419006},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4983971118927002},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4680250287055969},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4621591866016388},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.44519221782684326},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.44499528408050537},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.44309088587760925},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4165254533290863},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.41444170475006104},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.3861454725265503},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3576536178588867},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20164337754249573},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.08981779217720032}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9169481992721558},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.7881098985671997},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7502158880233765},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7165689468383789},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.6637064218521118},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.597938060760498},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5675469040870667},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5486541390419006},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4983971118927002},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4680250287055969},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4621591866016388},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.44519221782684326},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.44499528408050537},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.44309088587760925},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4165254533290863},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.41444170475006104},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.3861454725265503},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3576536178588867},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20164337754249573},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.08981779217720032},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-008-9180-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9180-4","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.6152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.6152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/~eyal/papers/decomp-algo.1.0-final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.6331","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.6331","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ubc.ca/~condon/papers/random.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.8529","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.8529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/~eyal/papers/decomp-algo.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":61,"referenced_works":["https://openalex.org/W26854244","https://openalex.org/W74727102","https://openalex.org/W83582759","https://openalex.org/W90191059","https://openalex.org/W143512583","https://openalex.org/W1480903797","https://openalex.org/W1523006294","https://openalex.org/W1537449969","https://openalex.org/W1538293711","https://openalex.org/W1551907897","https://openalex.org/W1573686114","https://openalex.org/W1577738755","https://openalex.org/W1587078595","https://openalex.org/W1589421353","https://openalex.org/W1593793857","https://openalex.org/W1636203894","https://openalex.org/W1671881141","https://openalex.org/W1934849835","https://openalex.org/W1964119857","https://openalex.org/W1965737603","https://openalex.org/W1972937804","https://openalex.org/W1985733932","https://openalex.org/W1999038767","https://openalex.org/W2005079828","https://openalex.org/W2019137761","https://openalex.org/W2027562075","https://openalex.org/W2029448190","https://openalex.org/W2029854525","https://openalex.org/W2037106315","https://openalex.org/W2047099957","https://openalex.org/W2059372025","https://openalex.org/W2064796716","https://openalex.org/W2076164610","https://openalex.org/W2081414924","https://openalex.org/W2085550081","https://openalex.org/W2098854122","https://openalex.org/W2107658650","https://openalex.org/W2121765622","https://openalex.org/W2121902703","https://openalex.org/W2123894844","https://openalex.org/W2125278290","https://openalex.org/W2140868064","https://openalex.org/W2141876475","https://openalex.org/W2150148016","https://openalex.org/W2150235218","https://openalex.org/W2151617868","https://openalex.org/W2152216760","https://openalex.org/W2154837415","https://openalex.org/W2159080219","https://openalex.org/W2340365916","https://openalex.org/W2405419040","https://openalex.org/W2498316819","https://openalex.org/W2752885492","https://openalex.org/W2782282317","https://openalex.org/W2888871578","https://openalex.org/W3014094413","https://openalex.org/W3145128584","https://openalex.org/W4213368513","https://openalex.org/W4242767541","https://openalex.org/W4285719527","https://openalex.org/W6648140929"],"related_works":["https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2027388354","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W2186377788","https://openalex.org/W4285428820","https://openalex.org/W4388554541","https://openalex.org/W2087911394"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":11}],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2025-10-10T00:00:00"}