{"id":"https://openalex.org/W1558213091","doi":"https://doi.org/10.1007/978-3-540-79719-7_10","title":"Complexity and Algorithms for Well-Structured k-SAT Instances","display_name":"Complexity and Algorithms for Well-Structured k-SAT Instances","publication_year":2008,"publication_date":"2008-05-06","ids":{"openalex":"https://openalex.org/W1558213091","doi":"https://doi.org/10.1007/978-3-540-79719-7_10","mag":"1558213091"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-79719-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-79719-7_10","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/A5104807074","display_name":"Konstantinos Georgiou","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Konstantinos Georgiou","raw_affiliation_strings":["Dept. of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada","University of Toronto, Dept. of Computer Science, Toronto, ON, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto, Dept. of Computer Science, Toronto, ON, Canada#TAB#","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089121499","display_name":"Periklis A. Papakonstantinou","orcid":"https://orcid.org/0009-0006-5734-5837"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Periklis A. Papakonstantinou","raw_affiliation_strings":["Dept. of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada","Dept. of Mathematics, University of Toronto, Toronto, ON, M5S 2E4, Canada","University of Toronto, Dept. of Computer Science, Toronto, ON, Canada and University of Toronto, Dept. of Mathematics, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, University of Toronto, Toronto, ON, M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Dept. of Mathematics, University of Toronto, Toronto, ON, M5S 2E4, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto, Dept. of Computer Science, Toronto, ON, Canada and University of Toronto, Dept. of Mathematics, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104807074"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.5339,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.80187874,"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":"105","last_page":"118"},"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.9983999729156494,"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.9945999979972839,"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/mathematics","display_name":"Mathematics","score":0.6600441932678223},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6354897618293762},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5795326232910156},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5270208120346069},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4898342788219452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47409069538116455},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4445821940898895},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4262096583843231},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4092210531234741},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37165695428848267},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.29995059967041016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21462181210517883},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07791975140571594}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6600441932678223},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6354897618293762},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5795326232910156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5270208120346069},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4898342788219452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47409069538116455},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4445821940898895},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4262096583843231},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4092210531234741},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37165695428848267},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.29995059967041016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21462181210517883},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07791975140571594},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-540-79719-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-79719-7_10","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.468.1588","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.468.1588","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utoronto.ca/~cgeorg/Complexity_and_Algorithms/sat_full2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.670.992","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.670.992","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iiis.tsinghua.edu.cn/%7Epapakons/pdfs/spaceSAT_sat08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W85690038","https://openalex.org/W179577048","https://openalex.org/W1490189322","https://openalex.org/W1509716515","https://openalex.org/W1510493756","https://openalex.org/W1537449969","https://openalex.org/W1606555018","https://openalex.org/W1752314164","https://openalex.org/W1979328074","https://openalex.org/W1982180670","https://openalex.org/W1984509356","https://openalex.org/W1991755800","https://openalex.org/W2006912660","https://openalex.org/W2016056456","https://openalex.org/W2017205387","https://openalex.org/W2019578639","https://openalex.org/W2019673912","https://openalex.org/W2021183451","https://openalex.org/W2025902957","https://openalex.org/W2027501230","https://openalex.org/W2027562075","https://openalex.org/W2029448190","https://openalex.org/W2033405938","https://openalex.org/W2036265926","https://openalex.org/W2038264652","https://openalex.org/W2043791970","https://openalex.org/W2057993122","https://openalex.org/W2063951771","https://openalex.org/W2069680070","https://openalex.org/W2074210283","https://openalex.org/W2079275582","https://openalex.org/W2080608361","https://openalex.org/W2081256023","https://openalex.org/W2090518395","https://openalex.org/W2103319518","https://openalex.org/W2105038944","https://openalex.org/W2109716789","https://openalex.org/W2114267503","https://openalex.org/W2139442450","https://openalex.org/W2143406303","https://openalex.org/W2159003936","https://openalex.org/W2162371997","https://openalex.org/W2476322857","https://openalex.org/W2486285674","https://openalex.org/W2596947455","https://openalex.org/W2984546510"],"related_works":["https://openalex.org/W4299559467","https://openalex.org/W2949617446","https://openalex.org/W4294299870","https://openalex.org/W2748664888","https://openalex.org/W1582492864","https://openalex.org/W4295887958","https://openalex.org/W2745231626","https://openalex.org/W1810116456","https://openalex.org/W2964174631","https://openalex.org/W4300619607"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}