{"id":"https://openalex.org/W1589594187","doi":"https://doi.org/10.1007/3-540-61332-3_153","title":"Reduction algorithms for constructing solutions in graphs with small treewidth","display_name":"Reduction algorithms for constructing solutions in graphs with small treewidth","publication_year":1996,"publication_date":"1996-01-01","ids":{"openalex":"https://openalex.org/W1589594187","doi":"https://doi.org/10.1007/3-540-61332-3_153","mag":"1589594187"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-61332-3_153","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61332-3_153","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":"book-chapter","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":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, the Netherlands","Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109882025","display_name":"Babette Fluiter","orcid":null},"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":"Babette Fluiter","raw_affiliation_strings":["Utrecht university >  >  >  >"],"affiliations":[{"raw_affiliation_string":"Utrecht university >  >  >  >","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.4308,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.81846706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"208"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9825000166893005,"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.9112433195114136},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6202921271324158},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5508869886398315},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5260655283927917},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5184870958328247},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5043030977249146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5005414485931396},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46480002999305725},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4495285749435425},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4491630494594574},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4354487657546997},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4174792766571045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40183907747268677},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3636060953140259},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35445621609687805},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11405518651008606}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9112433195114136},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6202921271324158},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5508869886398315},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5260655283927917},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5184870958328247},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5043030977249146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5005414485931396},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46480002999305725},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4495285749435425},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4491630494594574},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4354487657546997},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4174792766571045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40183907747268677},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3636060953140259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35445621609687805},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11405518651008606},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-61332-3_153","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-61332-3_153","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":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W26854244","https://openalex.org/W1541012495","https://openalex.org/W1973347908","https://openalex.org/W1983860528","https://openalex.org/W2018876684","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2064796716","https://openalex.org/W2132750992","https://openalex.org/W2164578838","https://openalex.org/W2986773320","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W2889180046","https://openalex.org/W2012687409","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W1976463682","https://openalex.org/W1544821268","https://openalex.org/W2567822775","https://openalex.org/W4297435153","https://openalex.org/W2113901576"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}