{"id":"https://openalex.org/W2143406303","doi":"https://doi.org/10.1007/3-540-19488-6_110","title":"Dynamic programming on graphs with bounded treewidth","display_name":"Dynamic programming on graphs with bounded treewidth","publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2143406303","doi":"https://doi.org/10.1007/3-540-19488-6_110","mag":"2143406303"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-19488-6_110","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-19488-6_110","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":true,"oa_status":"green","oa_url":"https://dspace.mit.edu/bitstream/1721.1/149658/1/MIT-LCS-TR-394.pdf","any_repository_has_fulltext":true},"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":["Dept. of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, the Netherlands","University of Utrecht"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, the Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"University of Utrecht","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":15.7301,"has_fulltext":true,"cited_by_count":317,"citation_normalized_percentile":{"value":0.99375488,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"105","last_page":"118"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9815999865531921,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9642000198364258,"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.9498685598373413},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.854935884475708},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7302548885345459},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7162701487541199},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6037910580635071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5982604026794434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5777617692947388},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5563628673553467},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5305517315864563},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4872521460056305},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47402244806289673},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.38493722677230835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38043633103370667},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10697564482688904}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9498685598373413},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.854935884475708},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7302548885345459},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7162701487541199},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6037910580635071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5982604026794434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5777617692947388},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5563628673553467},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5305517315864563},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4872521460056305},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47402244806289673},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.38493722677230835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38043633103370667},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10697564482688904},{"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/3-540-19488-6_110","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-19488-6_110","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"},{"id":"pmh:oai:dspace.mit.edu:1721.1/149658","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149658","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149658/1/MIT-LCS-TR-394.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.8503","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.8503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-394.pdf","raw_type":"text"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/16258","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/16258","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/149658","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/149658","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/149658/1/MIT-LCS-TR-394.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2143406303.pdf","grobid_xml":"https://content.openalex.org/works/W2143406303.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W143691565","https://openalex.org/W194684792","https://openalex.org/W1510832574","https://openalex.org/W1564936042","https://openalex.org/W1575035897","https://openalex.org/W1836127928","https://openalex.org/W1982584550","https://openalex.org/W1987698099","https://openalex.org/W2000760879","https://openalex.org/W2003021478","https://openalex.org/W2011039300","https://openalex.org/W2012615778","https://openalex.org/W2029448190","https://openalex.org/W2029841189","https://openalex.org/W2034501206","https://openalex.org/W2042792975","https://openalex.org/W2046904788","https://openalex.org/W2048013200","https://openalex.org/W2050565077","https://openalex.org/W2053439155","https://openalex.org/W2060378965","https://openalex.org/W2067380255","https://openalex.org/W2067396114","https://openalex.org/W2085550081","https://openalex.org/W2143406303","https://openalex.org/W2168519107","https://openalex.org/W2172037773","https://openalex.org/W2596181237","https://openalex.org/W3043060850","https://openalex.org/W6631969875","https://openalex.org/W6660345282","https://openalex.org/W6684418227","https://openalex.org/W6836243027"],"related_works":["https://openalex.org/W2091382007","https://openalex.org/W2143406303","https://openalex.org/W1485639265","https://openalex.org/W2223243427","https://openalex.org/W186753374","https://openalex.org/W2949199930","https://openalex.org/W2129003155","https://openalex.org/W2949940357","https://openalex.org/W143512583","https://openalex.org/W2951811902"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":18},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":17},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}