{"id":"https://openalex.org/W2743104256","doi":"https://doi.org/10.1007/978-3-319-66263-3_2","title":"Backdoor Treewidth for SAT","display_name":"Backdoor Treewidth for SAT","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2743104256","doi":"https://doi.org/10.1007/978-3-319-66263-3_2","mag":"2743104256"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-66263-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66263-3_2","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/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"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":"Robert Ganian","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112411811","display_name":"M. S. Ramanujan","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":"M. S. Ramanujan","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, 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":["Algorithms and Complexity Group, TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088116512"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.068,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76731828,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"20","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9932000041007996,"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.9894000291824341,"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/backdoor","display_name":"Backdoor","score":0.9687936305999756},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8632749915122986},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7892928719520569},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.590803861618042},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.4698179066181183},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36908721923828125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3455200791358948},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3066265881061554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2838915288448334},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.10876908898353577},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10494890809059143},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.09740003943443298}],"concepts":[{"id":"https://openalex.org/C2781045450","wikidata":"https://www.wikidata.org/wiki/Q254569","display_name":"Backdoor","level":2,"score":0.9687936305999756},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8632749915122986},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7892928719520569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.590803861618042},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4698179066181183},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36908721923828125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3455200791358948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3066265881061554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2838915288448334},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.10876908898353577},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10494890809059143},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.09740003943443298},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-66263-3_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66263-3_2","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W286506336","https://openalex.org/W749457272","https://openalex.org/W1511963917","https://openalex.org/W1532282263","https://openalex.org/W1541012495","https://openalex.org/W1559927413","https://openalex.org/W1589594187","https://openalex.org/W1605936044","https://openalex.org/W1732327014","https://openalex.org/W1965012931","https://openalex.org/W1973347908","https://openalex.org/W1974563688","https://openalex.org/W1983648207","https://openalex.org/W1996958432","https://openalex.org/W2002055996","https://openalex.org/W2018876684","https://openalex.org/W2029448190","https://openalex.org/W2099035480","https://openalex.org/W2116087731","https://openalex.org/W2141898804","https://openalex.org/W2255523963","https://openalex.org/W2412532104","https://openalex.org/W2914414140","https://openalex.org/W2952150057","https://openalex.org/W2963805305","https://openalex.org/W2984546510","https://openalex.org/W3145128584","https://openalex.org/W4206807714","https://openalex.org/W4213368513","https://openalex.org/W4241194700","https://openalex.org/W4245608944","https://openalex.org/W4246219036","https://openalex.org/W6634978047"],"related_works":["https://openalex.org/W4320031223","https://openalex.org/W4200629851","https://openalex.org/W2075531723","https://openalex.org/W2945561475","https://openalex.org/W4285659194","https://openalex.org/W4389814085","https://openalex.org/W3048010228","https://openalex.org/W3031065515","https://openalex.org/W2053685668","https://openalex.org/W2914625303"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}