{"id":"https://openalex.org/W2952150057","doi":"https://doi.org/10.1145/3014587","title":"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting","display_name":"Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W2952150057","doi":"https://doi.org/10.1145/3014587","mag":"2952150057"},"language":"en","primary_location":{"id":"doi:10.1145/3014587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3014587","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","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/A5088116512","display_name":"Robert Ganian","orcid":"https://orcid.org/0000-0002-7762-8045"},"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":"Robert Ganian","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112411811","display_name":"M. S. Ramanujan","orcid":null},"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":"M. S. Ramanujan","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","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":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088116512"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.6216,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.74782948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"2","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"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/T11106","display_name":"Data Management and Algorithms","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/unary-operation","display_name":"Unary operation","score":0.7318564057350159},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6645636558532715},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.577839732170105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5311509370803833},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.477710485458374},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4620145857334137},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.42654949426651},{"id":"https://openalex.org/keywords/regular-language","display_name":"Regular language","score":0.4250872731208801},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38633784651756287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35905224084854126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35361674427986145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22001692652702332},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.15241092443466187}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.7318564057350159},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6645636558532715},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.577839732170105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5311509370803833},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.477710485458374},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4620145857334137},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.42654949426651},{"id":"https://openalex.org/C52370388","wikidata":"https://www.wikidata.org/wiki/Q752532","display_name":"Regular language","level":3,"score":0.4250872731208801},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38633784651756287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35905224084854126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35361674427986145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22001692652702332},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.15241092443466187},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3014587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3014587","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W80728659","https://openalex.org/W1485150579","https://openalex.org/W1533487312","https://openalex.org/W1559927413","https://openalex.org/W1709155369","https://openalex.org/W1737419911","https://openalex.org/W1748315421","https://openalex.org/W1827493799","https://openalex.org/W1970318994","https://openalex.org/W1976090101","https://openalex.org/W1983342871","https://openalex.org/W1997649256","https://openalex.org/W2007046843","https://openalex.org/W2010124699","https://openalex.org/W2032487621","https://openalex.org/W2034122136","https://openalex.org/W2048685245","https://openalex.org/W2051856222","https://openalex.org/W2078752178","https://openalex.org/W2086937160","https://openalex.org/W2091345559","https://openalex.org/W2116407296","https://openalex.org/W2117290960","https://openalex.org/W2119456262","https://openalex.org/W2121641644","https://openalex.org/W2130190334","https://openalex.org/W2131358503","https://openalex.org/W2150339067","https://openalex.org/W2151131175","https://openalex.org/W2166566648","https://openalex.org/W2199961663","https://openalex.org/W2252346974","https://openalex.org/W2255523963","https://openalex.org/W2914729178","https://openalex.org/W2963478382","https://openalex.org/W3038118706","https://openalex.org/W3121437753","https://openalex.org/W4210733105","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2949820668","https://openalex.org/W4298774335","https://openalex.org/W2912152187","https://openalex.org/W123542748","https://openalex.org/W3196464229","https://openalex.org/W1557907101","https://openalex.org/W1980102547","https://openalex.org/W2015204833","https://openalex.org/W4298364136","https://openalex.org/W2949371583"],"abstract_inverted_index":{"The":[0,317],"Constraint":[1],"Satisfaction":[2],"Problem":[3],"(CSP)":[4],"is":[5,28,64,88,200,255,333,364,409,426],"a":[6,14,76,80,85,114,138,188,239,243,256,274,301,308,323,369,385,389,394,412],"central":[7,24],"and":[8,20,123,148,175,345],"generic":[9],"computational":[10],"problem":[11],"which":[12,38,254,455],"provides":[13],"common":[15],"framework":[16],"for":[17,37,62,146,173,420,429,454],"many":[18,121],"theoretical":[19],"practical":[21],"applications.":[22],"A":[23,54],"line":[25],"of":[26,33,35,52,57,60,105,109,117,125,141,144,158,168,196,218,238,242,258,269,277,288,303,314,326,341,355,396,401,443,450],"research":[27],"concerned":[29],"with":[30,228,352,372,393],"the":[31,67,73,149,165,169,194,222,236,264,342,347,353,358,417,430,440,444],"identification":[32,449],"classes":[34,47,285,453],"instances":[36,182,290],"CSP":[39,63,147,174,244,289,370],"can":[40,207,336,458],"be":[41,459],"solved":[42],"in":[43,72,107,156,321,376],"polynomial":[44,348],"time;":[45],"such":[46,411],"are":[48,154],"often":[49],"called":[50,79],"\u201cislands":[51],"tractability.\u201d":[53],"prominent":[55],"way":[56],"defining":[58],"islands":[59,104,143,354],"tractability":[61,106,145,171,315,356],"to":[65,75,181,187,266,273,297,447],"restrict":[66],"relations":[68],"that":[69,153,177,205,260,271,407,424],"may":[70],"occur":[71],"constraints":[74,185,220],"fixed":[77],"set,":[78],"constraint":[81,86,111,160,399,432],"language":[82,87,191],",":[83,286],"whereas":[84],"conservative":[89,159,398],"if":[90],"it":[91,332],"contains":[92],"all":[93,103,142,184,338],"unary":[94],"relations.":[95],"Schaefer\u2019s":[96],"famous":[97],"Dichotomy":[98],"Theorem":[99],"(STOC":[100],"1978)":[101],"identifies":[102],"terms":[108,157],"tractable":[110,190,198,225,275,304,428],"languages":[112,199,226],"over":[113,221],"Boolean":[115],"domain":[116],"values.":[118],"Since":[119],"then,":[120],"extensions":[122],"generalizations":[124],"this":[126,209,232],"result":[127,363,435],"have":[128],"been":[129],"obtained.":[130],"Recently,":[131],"Bulatov":[132],"(TOCL":[133],"2011,":[134],"JACM":[135],"2013)":[136],"gave":[137],"full":[139],"characterization":[140],"counting":[150],"version":[151],"#CSP":[152],"defined":[155],"languages.":[161,433],"This":[162,414],"article":[163],"addresses":[164],"general":[166],"limit":[167],"mentioned":[170],"results":[172],"#CSP,":[176],"they":[178],"only":[179],"apply":[180,346],"where":[183,291],"belong":[186],"single":[189],"(in":[192],"general,":[193],"union":[195],"two":[197],"not":[201,410],"tractable).":[202],"We":[203,279],"show":[204],"we":[206,214,234,335],"overcome":[208],"limitation":[210],"as":[211,213,246],"long":[212],"keep":[215],"some":[216,298],"control":[217],"how":[219],"various":[223],"considered":[224,431],"interact":[227],"each":[229,292],"other.":[230],"For":[231],"purpose,":[233],"utilize":[235],"notion":[237],"strong":[240,281,324,386],"backdoor":[241,325,343,387],"instance,":[245],"introduced":[247],"by":[248],"Williams":[249],"et":[250],"al.":[251],"(IJCAI":[252],"2003),":[253],"set":[257],"variables":[259,344],"when":[261],"instantiated,":[262],"moves":[263],"instance":[265,371],"an":[267,312,365],"island":[268],"tractability,":[270],"is,":[272],"class":[276,299,310,391],"instances.":[278],"consider":[280],"backdoors":[282,457],"into":[283,388],"scattered":[284,309,390],"consisting":[287],"connected":[293],"component":[294],"belongs":[295],"entirely":[296],"from":[300],"list":[302,359,395],"classes.":[305],"Figuratively":[306],"speaking,":[307],"constitutes":[311],"archipelago":[313],".":[316],"main":[318,362,441],"difficulty":[319],"lies":[320],"finding":[322],"given":[327,368],"size":[328,402],"k":[329,380,403],";":[330],"once":[331],"found,":[334],"try":[337],"possible":[339],"instantiations":[340],"time":[349,377,419],"algorithms":[350],"associated":[351],"on":[357],"component-wise.":[360],"Our":[361,434],"algorithm":[366],"that,":[367],"n":[373,382],"variables,":[374],"finds":[375],"f":[378],"(":[379],")":[381],"O":[383],"(1)":[384],"(associated":[392],"finite":[397],"languages)":[400],"or":[404],"correctly":[405],"decides":[406],"there":[408],"backdoor.":[413],"also":[415],"gives":[416],"running":[418],"solving":[421],"(#)CSP,":[422],"provided":[423],"(#)CSP":[425],"polynomial-time":[427],"makes":[436],"significant":[437],"progress":[438],"towards":[439],"goal":[442],"backdoor-based":[445],"approach":[446],"CSPs\u2014the":[448],"maximal":[451],"base":[452],"small":[456],"detected":[460],"efficiently.":[461]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}