{"id":"https://openalex.org/W1514793018","doi":"https://doi.org/10.1007/3-540-45995-2_32","title":"Improved Exact Algorithms for Max-Sat","display_name":"Improved Exact Algorithms for Max-Sat","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1514793018","doi":"https://doi.org/10.1007/3-540-45995-2_32","mag":"1514793018"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45995-2_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_32","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/A5023394727","display_name":"Jianer Chen","orcid":"https://orcid.org/0000-0003-0898-1643"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jianer Chen","raw_affiliation_strings":["Department of Computer Science, Texas A& M University, 77843-3112, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A& M University, 77843-3112, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","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":false,"raw_author_name":"Iyad A. Kanj","raw_affiliation_strings":["School of CTI, DePaul University, 243S. Wabash Avenue, 60604, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"School of CTI, DePaul University, 243S. Wabash Avenue, 60604, Chicago, IL, USA","institution_ids":["https://openalex.org/I118353179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023394727"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5993,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.92455911,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"341","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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.9958999752998352,"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/T11567","display_name":"semigroups and automata theory","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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8924955725669861},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6793079376220703},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6422330737113953},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.6305913925170898},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6092356443405151},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.5301151275634766},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4773140847682953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4751396179199219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43195319175720215},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42261889576911926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4223834276199341},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3463935852050781}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8924955725669861},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6793079376220703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6422330737113953},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.6305913925170898},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6092356443405151},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.5301151275634766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4773140847682953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4751396179199219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43195319175720215},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42261889576911926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4223834276199341},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3463935852050781}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/3-540-45995-2_32","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_32","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:CiteSeerX.psu:10.1.1.93.73","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.73","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://facweb.cs.depaul.edu/ikanj/papers/Latex/maxsat/dam/revised/second_revision/Final_Submission/paper.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W17690413","https://openalex.org/W53068427","https://openalex.org/W103980366","https://openalex.org/W220246032","https://openalex.org/W272087405","https://openalex.org/W1480023663","https://openalex.org/W1504534238","https://openalex.org/W1513769081","https://openalex.org/W1548160868","https://openalex.org/W1557597301","https://openalex.org/W1564733196","https://openalex.org/W1581661059","https://openalex.org/W1727001693","https://openalex.org/W1883558934","https://openalex.org/W1896404939","https://openalex.org/W1965762037","https://openalex.org/W1972577597","https://openalex.org/W1972845596","https://openalex.org/W1977287297","https://openalex.org/W1983156760","https://openalex.org/W1983330102","https://openalex.org/W1995725694","https://openalex.org/W2000863020","https://openalex.org/W2006838440","https://openalex.org/W2006933117","https://openalex.org/W2009384947","https://openalex.org/W2011039300","https://openalex.org/W2026771935","https://openalex.org/W2027049731","https://openalex.org/W2036185701","https://openalex.org/W2043997666","https://openalex.org/W2062897452","https://openalex.org/W2073025989","https://openalex.org/W2081782720","https://openalex.org/W2085521211","https://openalex.org/W2092842298","https://openalex.org/W2096681449","https://openalex.org/W2108093643","https://openalex.org/W2123784540","https://openalex.org/W2125065856","https://openalex.org/W2154474334","https://openalex.org/W2161678469","https://openalex.org/W2171680292","https://openalex.org/W2394551636","https://openalex.org/W2913688336","https://openalex.org/W3093981756","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W6606298547","https://openalex.org/W6630093876","https://openalex.org/W6631520148","https://openalex.org/W6634777343","https://openalex.org/W6742501960"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2332241156","https://openalex.org/W3136261533","https://openalex.org/W4240446120","https://openalex.org/W3173322326","https://openalex.org/W2144163060","https://openalex.org/W2014111643"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}