{"id":"https://openalex.org/W2173621488","doi":"https://doi.org/10.1007/978-3-319-12691-3_48","title":"Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications","display_name":"Parameterized and Subexponential-Time Complexity of Satisfiability Problems and Applications","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2173621488","doi":"https://doi.org/10.1007/978-3-319-12691-3_48","mag":"2173621488"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-12691-3_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12691-3_48","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/A5009111693","display_name":"Iyad Kanj","orcid":"https://orcid.org/0000-0003-1698-8829"},"institutions":[{"id":"https://openalex.org/I118353179","display_name":"DePaul University","ror":"https://ror.org/04xtx5t16","country_code":"US","type":"education","lineage":["https://openalex.org/I118353179"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Iyad Kanj","raw_affiliation_strings":["School of Computing, DePaul University, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, DePaul University, Chicago, USA","institution_ids":["https://openalex.org/I118353179"]}]},{"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":["Vienna University of Technology, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Vienna University of Technology, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009111693"],"corresponding_institution_ids":["https://openalex.org/I118353179"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17506525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"637","last_page":"651"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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.9669189453125},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6842219829559326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5260232090950012},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5022106170654297},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4575899839401245},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4053264558315277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3654688596725464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2698134481906891}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9669189453125},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6842219829559326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5260232090950012},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5022106170654297},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4575899839401245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4053264558315277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3654688596725464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2698134481906891}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-12691-3_48","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-12691-3_48","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/W200564616","https://openalex.org/W1525726608","https://openalex.org/W1570425181","https://openalex.org/W1983156760","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2006337932","https://openalex.org/W2009147258","https://openalex.org/W2012948111","https://openalex.org/W2017619848","https://openalex.org/W2027999353","https://openalex.org/W2038225707","https://openalex.org/W2087638517","https://openalex.org/W2116087731","https://openalex.org/W2130190334","https://openalex.org/W2139087151","https://openalex.org/W2142120952","https://openalex.org/W2156223756","https://openalex.org/W2157494948","https://openalex.org/W2159892713","https://openalex.org/W2165019867","https://openalex.org/W2490706771","https://openalex.org/W2883953303","https://openalex.org/W4214889528","https://openalex.org/W4256418102"],"related_works":["https://openalex.org/W1865369187","https://openalex.org/W2997249752","https://openalex.org/W2523981875","https://openalex.org/W1767868015","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}