{"id":"https://openalex.org/W1821762897","doi":"https://doi.org/10.1007/978-3-642-02777-2_6","title":"Encoding Treewidth into SAT","display_name":"Encoding Treewidth into SAT","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1821762897","doi":"https://doi.org/10.1007/978-3-642-02777-2_6","mag":"1821762897"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02777-2_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_6","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/A5021237641","display_name":"Marko Samer","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marko Samer","raw_affiliation_strings":["Department of Computer Science, TU Darmstadt, Germany","Department of Computer Science, TU, Darmstadt, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Department of Computer Science, TU, Darmstadt, Germany#TAB#","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110701511","display_name":"Helmut Veith","orcid":null},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Helmut Veith","raw_affiliation_strings":["Department of Computer Science, TU Darmstadt, Germany","Department of Computer Science, TU, Darmstadt, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, TU Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Department of Computer Science, TU, Darmstadt, Germany#TAB#","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5021237641"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.16463792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9965000152587891,"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/T10142","display_name":"Formal Methods in Verification","score":0.9878000020980835,"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.9512161612510681},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.7252694964408875},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.7094351053237915},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.6830058097839355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5224153995513916},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4505517780780792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43004706501960754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42584747076034546},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42331787943840027},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42017319798469543},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34549400210380554},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.34442365169525146},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.31896311044692993},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2581232190132141},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.19951793551445007}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9512161612510681},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.7252694964408875},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.7094351053237915},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.6830058097839355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5224153995513916},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4505517780780792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43004706501960754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42584747076034546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42331787943840027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42017319798469543},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34549400210380554},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.34442365169525146},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.31896311044692993},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2581232190132141},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.19951793551445007}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-02777-2_6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_6","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":20,"referenced_works":["https://openalex.org/W47957325","https://openalex.org/W179577048","https://openalex.org/W1506542774","https://openalex.org/W1507341838","https://openalex.org/W1527664624","https://openalex.org/W1545803195","https://openalex.org/W1572383262","https://openalex.org/W1628915153","https://openalex.org/W2029448190","https://openalex.org/W2085550081","https://openalex.org/W2100609826","https://openalex.org/W2103080151","https://openalex.org/W2113901576","https://openalex.org/W2118348318","https://openalex.org/W2132750992","https://openalex.org/W2174973502","https://openalex.org/W2487140311","https://openalex.org/W2543951292","https://openalex.org/W2895284333","https://openalex.org/W2914617426"],"related_works":["https://openalex.org/W6903974","https://openalex.org/W2143406303","https://openalex.org/W2962819865","https://openalex.org/W2162616398","https://openalex.org/W2091382007","https://openalex.org/W2223243427","https://openalex.org/W133962531","https://openalex.org/W2949940357","https://openalex.org/W186753374","https://openalex.org/W2737935917"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}