{"id":"https://openalex.org/W2164578838","doi":"https://doi.org/10.1007/3-540-57899-4_40","title":"On reduction algorithms for graphs with small treewidth","display_name":"On reduction algorithms for graphs with small treewidth","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2164578838","doi":"https://doi.org/10.1007/3-540-57899-4_40","mag":"2164578838"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-57899-4_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57899-4_40","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"],"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"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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":3.2482,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91610564,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"56"},"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.9988999962806702,"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/T11567","display_name":"semigroups and automata theory","score":0.9840999841690063,"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.9663335084915161},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7152835726737976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6017811894416809},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5810509920120239},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5525953769683838},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5447448492050171},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46069949865341187},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4527207016944885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44319581985473633},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4403049945831299},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4206128418445587},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4152102768421173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41152238845825195},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3761315941810608},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.36074256896972656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34167924523353577},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.09125930070877075}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9663335084915161},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7152835726737976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6017811894416809},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5810509920120239},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5525953769683838},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5447448492050171},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46069949865341187},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4527207016944885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44319581985473633},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4403049945831299},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4206128418445587},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4152102768421173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41152238845825195},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3761315941810608},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.36074256896972656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34167924523353577},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.09125930070877075},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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/3-540-57899-4_40","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-57899-4_40","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":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W26854244","https://openalex.org/W1532282263","https://openalex.org/W1636203894","https://openalex.org/W1836127928","https://openalex.org/W1983860528","https://openalex.org/W2018876684","https://openalex.org/W2024291212","https://openalex.org/W2028357390","https://openalex.org/W2029448190","https://openalex.org/W2064796716","https://openalex.org/W2132750992","https://openalex.org/W2151617868","https://openalex.org/W2159003936","https://openalex.org/W2913344232","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W2012687409","https://openalex.org/W2111290740","https://openalex.org/W143512583","https://openalex.org/W2962819865","https://openalex.org/W1976463682","https://openalex.org/W1585579706","https://openalex.org/W2162616398","https://openalex.org/W4297435153","https://openalex.org/W2029854525","https://openalex.org/W2567822775"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}