{"id":"https://openalex.org/W2080763555","doi":"https://doi.org/10.1007/978-3-642-21581-0_3","title":"Parameterized Complexity of DPLL Search Procedures","display_name":"Parameterized Complexity of DPLL Search Procedures","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2080763555","doi":"https://doi.org/10.1007/978-3-642-21581-0_3","mag":"2080763555"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-21581-0_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21581-0_3","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/A5042128349","display_name":"Olaf Beyersdorff","orcid":"https://orcid.org/0000-0002-2870-1648"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Olaf Beyersdorff","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084573067","display_name":"Nicola Galesi","orcid":"https://orcid.org/0000-0002-8522-362X"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Galesi","raw_affiliation_strings":["Dipartimento di Informatica, Sapienza Universit\u00e0 di Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Sapienza Universit\u00e0 di Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024267515","display_name":"Massimo Lauria","orcid":"https://orcid.org/0000-0003-4003-3168"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimo Lauria","raw_affiliation_strings":["Dipartimento di Informatica, Sapienza Universit\u00e0 di Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Sapienza Universit\u00e0 di Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042128349"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.113,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91627451,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"5","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.9979000091552734,"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.9962999820709229,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"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/dpll-algorithm","display_name":"DPLL algorithm","score":0.9489320516586304},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.9285615086555481},{"id":"https://openalex.org/keywords/pigeonhole-principle","display_name":"Pigeonhole principle","score":0.8885999917984009},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.6619879603385925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5857651829719543},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5565191507339478},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4624043107032776},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.415494441986084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4078024625778198},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3791918158531189},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3467235863208771},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25009775161743164},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18634480237960815}],"concepts":[{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.9489320516586304},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9285615086555481},{"id":"https://openalex.org/C171988527","wikidata":"https://www.wikidata.org/wiki/Q188276","display_name":"Pigeonhole principle","level":2,"score":0.8885999917984009},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.6619879603385925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5857651829719543},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5565191507339478},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4624043107032776},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.415494441986084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4078024625778198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3791918158531189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3467235863208771},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25009775161743164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18634480237960815},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C134652429","wikidata":"https://www.wikidata.org/wiki/Q1052698","display_name":"Jitter","level":2,"score":0.0},{"id":"https://openalex.org/C12707504","wikidata":"https://www.wikidata.org/wiki/Q52637","display_name":"Phase-locked loop","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-21581-0_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-21581-0_3","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"},{"id":"pmh:oai:iris.uniroma1.it:11573/392502","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/392502","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1572996061","https://openalex.org/W1979753555","https://openalex.org/W1986272823","https://openalex.org/W1988083342","https://openalex.org/W1988762827","https://openalex.org/W1990604066","https://openalex.org/W1995885398","https://openalex.org/W2044722214","https://openalex.org/W2047237020","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2067510740","https://openalex.org/W2069767473","https://openalex.org/W2079758416","https://openalex.org/W2084029169","https://openalex.org/W2084384424","https://openalex.org/W2097113315","https://openalex.org/W2098022011","https://openalex.org/W2100738443","https://openalex.org/W2105786826","https://openalex.org/W2110128015","https://openalex.org/W2126362918","https://openalex.org/W2126420408","https://openalex.org/W2137423523","https://openalex.org/W2142127354","https://openalex.org/W2150936971","https://openalex.org/W2152390092","https://openalex.org/W2171790376","https://openalex.org/W2323554188","https://openalex.org/W2396992663","https://openalex.org/W2478722229","https://openalex.org/W3144881883","https://openalex.org/W4251265810"],"related_works":["https://openalex.org/W2150419136","https://openalex.org/W2396992663","https://openalex.org/W2045690379","https://openalex.org/W2007316622","https://openalex.org/W2408711288","https://openalex.org/W1024451821","https://openalex.org/W1865369187","https://openalex.org/W2094368841","https://openalex.org/W2997249752","https://openalex.org/W2523981875"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}