{"id":"https://openalex.org/W2744965439","doi":"https://doi.org/10.1007/978-3-319-66263-3_25","title":"SAT-Based Local Improvement for Finding Tree Decompositions of Small Width","display_name":"SAT-Based Local Improvement for Finding Tree Decompositions of Small Width","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2744965439","doi":"https://doi.org/10.1007/978-3-319-66263-3_25","mag":"2744965439"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-66263-3_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66263-3_25","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":"conference-paper","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/A5089442472","display_name":"Johannes K. Fichte","orcid":"https://orcid.org/0000-0002-8681-7470"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Johannes K. Fichte","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028911972","display_name":"Neha Lodha","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Neha Lodha","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089442472"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8513,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91575691,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"401","last_page":"411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9937000274658203,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristics","display_name":"Heuristics","score":0.7376657724380493},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6981515884399414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6174525022506714},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6011909246444702},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5205293893814087},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5181257128715515},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5102274417877197},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48712825775146484},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4811914563179016},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.44257086515426636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32966458797454834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2775944173336029},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19012874364852905},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1456216275691986},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.12967854738235474}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7376657724380493},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6981515884399414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6174525022506714},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6011909246444702},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5205293893814087},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5181257128715515},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5102274417877197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48712825775146484},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4811914563179016},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.44257086515426636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32966458797454834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2775944173336029},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19012874364852905},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1456216275691986},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12967854738235474},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-66263-3_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66263-3_25","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1026269243","https://openalex.org/W1507341838","https://openalex.org/W1593793857","https://openalex.org/W1628915153","https://openalex.org/W1702884067","https://openalex.org/W1821762897","https://openalex.org/W2003272551","https://openalex.org/W2021180976","https://openalex.org/W2075530391","https://openalex.org/W2080192364","https://openalex.org/W2083408803","https://openalex.org/W2085550081","https://openalex.org/W2100609826","https://openalex.org/W2109716789","https://openalex.org/W2116793595","https://openalex.org/W2153074847","https://openalex.org/W2164230672","https://openalex.org/W2207672057","https://openalex.org/W2408617648","https://openalex.org/W2465457706","https://openalex.org/W2593268036","https://openalex.org/W2617661790","https://openalex.org/W2750561661","https://openalex.org/W4213368513"],"related_works":["https://openalex.org/W3119129187","https://openalex.org/W2609269940","https://openalex.org/W2175175400","https://openalex.org/W2040947692","https://openalex.org/W1493010546","https://openalex.org/W2403489339","https://openalex.org/W49964765","https://openalex.org/W2138319640","https://openalex.org/W1507841763","https://openalex.org/W1504425306"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}