{"id":"https://openalex.org/W195515244","doi":"https://doi.org/10.1007/978-3-319-09284-3_8","title":"Fixed-Parameter Tractable Reductions to SAT","display_name":"Fixed-Parameter Tractable Reductions to SAT","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W195515244","doi":"https://doi.org/10.1007/978-3-319-09284-3_8","mag":"195515244"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-09284-3_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09284-3_8","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/A5068702258","display_name":"Ronald de Haan","orcid":"https://orcid.org/0000-0003-2023-0586"},"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":"Ronald de Haan","raw_affiliation_strings":["Institute of Information Systems, Vienna University of Technology, Vienna, Austria","Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of Technology","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":["Institute of Information Systems, Vienna University of Technology, Vienna, Austria","Vienna University of Technology"],"affiliations":[{"raw_affiliation_string":"Institute of Information Systems, Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Vienna University of Technology","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068702258"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.1863,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.96490876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"102"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.988099992275238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8990252614021301},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7591156959533691},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.6953946352005005},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6943733096122742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.652110755443573},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6238579154014587},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.60898357629776},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5667708516120911},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5653587579727173},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5487306118011475},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5476693511009216},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4505142569541931},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.37110328674316406},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3410857319831848},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3297193646430969}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8990252614021301},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7591156959533691},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.6953946352005005},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6943733096122742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652110755443573},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6238579154014587},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.60898357629776},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5667708516120911},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5653587579727173},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5487306118011475},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5476693511009216},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4505142569541931},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.37110328674316406},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3410857319831848},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3297193646430969},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-09284-3_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-09284-3_8","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":52,"referenced_works":["https://openalex.org/W9517092","https://openalex.org/W36639738","https://openalex.org/W79534266","https://openalex.org/W135876007","https://openalex.org/W143512583","https://openalex.org/W194026504","https://openalex.org/W1496518193","https://openalex.org/W1515623105","https://openalex.org/W1517036688","https://openalex.org/W1532594152","https://openalex.org/W1549449731","https://openalex.org/W1570425181","https://openalex.org/W1583869287","https://openalex.org/W1586677474","https://openalex.org/W1587191403","https://openalex.org/W1589421353","https://openalex.org/W1607926272","https://openalex.org/W1787074469","https://openalex.org/W1817412228","https://openalex.org/W1879512746","https://openalex.org/W1973101725","https://openalex.org/W1983648207","https://openalex.org/W1988772559","https://openalex.org/W1999396796","https://openalex.org/W2007381442","https://openalex.org/W2011844594","https://openalex.org/W2012170877","https://openalex.org/W2014117644","https://openalex.org/W2026745535","https://openalex.org/W2028124393","https://openalex.org/W2050186596","https://openalex.org/W2058277150","https://openalex.org/W2065251436","https://openalex.org/W2072181151","https://openalex.org/W2075530391","https://openalex.org/W2087083200","https://openalex.org/W2110123236","https://openalex.org/W2120111623","https://openalex.org/W2143406303","https://openalex.org/W2152426072","https://openalex.org/W2155165652","https://openalex.org/W2165930340","https://openalex.org/W2401003083","https://openalex.org/W2402235836","https://openalex.org/W2481137663","https://openalex.org/W2913688336","https://openalex.org/W2963038528","https://openalex.org/W2964181285","https://openalex.org/W4213368513","https://openalex.org/W4248733413","https://openalex.org/W4292230561","https://openalex.org/W6634978047"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2332241156","https://openalex.org/W2014111643","https://openalex.org/W2127594621","https://openalex.org/W195515244","https://openalex.org/W2399929470"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}