{"id":"https://openalex.org/W1548225002","doi":"https://doi.org/10.1007/978-3-319-03898-8_5","title":"The Fine Details of Fast Dynamic Programming over Tree Decompositions","display_name":"The Fine Details of Fast Dynamic Programming over Tree Decompositions","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1548225002","doi":"https://doi.org/10.1007/978-3-319-03898-8_5","mag":"1548225002"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-03898-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03898-8_5","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 Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of 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/A5079322669","display_name":"Paul Bonsma","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Paul Bonsma","raw_affiliation_strings":["Faculty of EEMCS, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Faculty of EEMCS, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"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":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, P.O. Box 7803, 5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, P.O. Box 7803, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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":0.0,"has_fulltext":true,"cited_by_count":26,"citation_normalized_percentile":{"value":0.15592885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"53"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9951000213623047,"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.9868000149726868,"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/combinatorics","display_name":"Combinatorics","score":0.6223647594451904},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.5649314522743225},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5496460199356079},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5077139139175415},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45973384380340576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4553419351577759},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45063701272010803},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.41599732637405396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4034523367881775},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36577942967414856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3153485655784607}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6223647594451904},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.5649314522743225},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5496460199356079},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5077139139175415},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45973384380340576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4553419351577759},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45063701272010803},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.41599732637405396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4034523367881775},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36577942967414856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3153485655784607},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-03898-8_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-03898-8_5","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:ris.utwente.nl:publications/831e636f-3563-48ba-b479-3ededed568c9","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/831e636f-3563-48ba-b479-3ededed568c9","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bodlaender, H L, Bonsma, P S & Lokshtanov, D 2013, The fine details of fast dynamic programming over tree decompositions. in G Gutin & S Szeider (eds), Proceedings of the 8th International Symposium on Parameterized and Exact Computation (IPEC 2013). Lecture Notes in Computer Science, vol. 8246, Springer, Berlin, pp. 41-53, 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, Sophia Antipolis, France, 4/09/13. https://doi.org/10.1007/978-3-319-03898-8_5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.417.1931","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.1931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ii.uib.no/~daniello/papers/treewidthDpDetails.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W133771224","https://openalex.org/W1492169292","https://openalex.org/W1517036688","https://openalex.org/W1579510955","https://openalex.org/W1589421353","https://openalex.org/W1655990431","https://openalex.org/W1787126581","https://openalex.org/W1804016314","https://openalex.org/W1816837704","https://openalex.org/W1985572324","https://openalex.org/W1991755800","https://openalex.org/W2021180976","https://openalex.org/W2028357390","https://openalex.org/W2059109315","https://openalex.org/W2059273723","https://openalex.org/W2067264828","https://openalex.org/W2093949146","https://openalex.org/W2143406303","https://openalex.org/W2180988813","https://openalex.org/W2500252975","https://openalex.org/W2798588639","https://openalex.org/W2951007762","https://openalex.org/W4213311856","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W2611163850","https://openalex.org/W3015250136","https://openalex.org/W1980812295","https://openalex.org/W1845849701","https://openalex.org/W2044218713","https://openalex.org/W2625268413","https://openalex.org/W2962989220","https://openalex.org/W2379234996","https://openalex.org/W4247900000","https://openalex.org/W3013085049"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}