{"id":"https://openalex.org/W2159738186","doi":"https://doi.org/10.1145/1806689.1806790","title":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries","display_name":"Tractable hypergraph properties for constraint satisfaction and conjunctive queries","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2159738186","doi":"https://doi.org/10.1145/1806689.1806790","mag":"2159738186"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012849997"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":11.2638,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.9928138,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"735","last_page":"744"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.996999979019165,"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.9966999888420105,"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/hypergraph","display_name":"Hypergraph","score":0.8329379558563232},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7740472555160522},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.741567075252533},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7323498129844666},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6707277297973633},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.631685733795166},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6200533509254456},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5893805623054504},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.5870981216430664},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.49775341153144836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4801751673221588},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4497499465942383},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4487598240375519},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4428447484970093},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35676896572113037},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2528696656227112},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1415826380252838},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13687947392463684},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.08578762412071228}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8329379558563232},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7740472555160522},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.741567075252533},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7323498129844666},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6707277297973633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.631685733795166},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6200533509254456},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5893805623054504},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.5870981216430664},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.49775341153144836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4801751673221588},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4497499465942383},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4487598240375519},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4428447484970093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35676896572113037},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2528696656227112},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1415826380252838},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13687947392463684},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.08578762412071228},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W52840101","https://openalex.org/W99828349","https://openalex.org/W153181359","https://openalex.org/W1485335602","https://openalex.org/W1539745358","https://openalex.org/W1570425181","https://openalex.org/W1571197496","https://openalex.org/W1603707154","https://openalex.org/W1957035253","https://openalex.org/W1973819999","https://openalex.org/W1979514837","https://openalex.org/W1989801809","https://openalex.org/W1993704152","https://openalex.org/W1994520092","https://openalex.org/W1995725694","https://openalex.org/W2006772093","https://openalex.org/W2006830086","https://openalex.org/W2008362572","https://openalex.org/W2008536061","https://openalex.org/W2009924457","https://openalex.org/W2012948111","https://openalex.org/W2021183451","https://openalex.org/W2026745535","https://openalex.org/W2033325972","https://openalex.org/W2035575256","https://openalex.org/W2045675568","https://openalex.org/W2049197377","https://openalex.org/W2050280202","https://openalex.org/W2057256946","https://openalex.org/W2063951771","https://openalex.org/W2067443074","https://openalex.org/W2085367693","https://openalex.org/W2104498537","https://openalex.org/W2111829945","https://openalex.org/W2116407296","https://openalex.org/W2128059732","https://openalex.org/W2129023820","https://openalex.org/W2134483537","https://openalex.org/W2134850460","https://openalex.org/W2140285470","https://openalex.org/W2148417962","https://openalex.org/W2150004999","https://openalex.org/W2150339067","https://openalex.org/W2157827214","https://openalex.org/W2162561603","https://openalex.org/W2165880875","https://openalex.org/W2166566648","https://openalex.org/W2175676614","https://openalex.org/W2489198132","https://openalex.org/W2913688336","https://openalex.org/W4254380579","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2949978915","https://openalex.org/W2480025839","https://openalex.org/W2119213574","https://openalex.org/W1973538949","https://openalex.org/W2628596753","https://openalex.org/W2950294966","https://openalex.org/W1988026822","https://openalex.org/W4292713356","https://openalex.org/W2134402143","https://openalex.org/W3169968423"],"abstract_inverted_index":{"An":[0],"important":[1],"question":[2],"in":[3,81,91,113,266,330,419],"the":[4,14,19,23,26,29,43,48,51,56,59,62,68,135,140,151,159,162,167,254,278,280,291,297,302,325,335,343,351,364,420,423,427],"study":[5],"of":[6,22,28,50,58,61,76,100,122,137,153,161,169,180,208,271,287,294,315,346,353,372,411,429],"constraint":[7,38],"satisfaction":[8],"problems":[9,90],"(CSP)":[10],"is":[11,45,66,97,112,117,127,155,171,187,211,225,244,282,323,398,432],"understanding":[12],"how":[13],"graph":[15,60],"or":[16,130],"hypergraph":[17,111,197,378,397],"describing":[18],"incidence":[20],"structure":[21],"constraints":[24,72],"influences":[25],"complexity":[27,49],"problem.":[30],"For":[31,363],"binary":[32],"CSP":[33,84,106,394],"instances":[34,85,109,288,304,337],"(i.e.,":[35],"where":[36],"each":[37,314],"involves":[39],"only":[40],"two":[41],"variables),":[42],"situation":[44],"well":[46],"understood:":[47],"problem":[52],"essentially":[53],"depends":[54],"on":[55,277,290,414],"treewidth":[57],"constraints.":[63],"However,":[64],"this":[65,320],"not":[67,245,250],"correct":[69],"answer":[70],"if":[71,95,236,376],"with":[73,340],"unbounded":[74,239],"number":[75,136,152,168,344,352],"variables":[77,154,170,295],"are":[78,305,338],"allowed,":[79],"and":[80,202,300,349,416],"particular,":[82],"for":[83,124,313],"arising":[86],"from":[87],"query":[88,145],"evaluation":[89],"database":[92,144],"theory.":[93],"Formally,":[94],"H":[96,181,209,237,379],"a":[98,172,195,212,229,267,273,285,309,332,360,370,377,385,393,409],"class":[99],"hypergraphs,":[101],"then":[102,242,301,384],"let":[103],"CSP(H)":[104,126,184,224,243],"be":[105,328,357,389],"restricted":[107],"to":[108,118,143,342,407],"whose":[110,396],"H.":[114,399],"Our":[115],"goal":[116],"characterize":[119],"those":[120],"classes":[121],"hypergraphs":[123,415],"which":[125],"polynomial-time":[128,185,251],"solvable":[129,186],"fixed-parameter":[131,226,246],"tractable,":[132],"parameterized":[133],"by":[134,166,307,359,392],"variables.":[138],"In":[139,228],"applications":[141],"related":[142],"evaluation,":[146],"we":[147,193,233,367,405],"usually":[148],"assume":[149],"that":[150,182,204,223,235,324,334,375],"much":[156],"smaller":[157],"than":[158,217],"size":[160],"instance,":[163],"thus":[164],"parameterization":[165],"meaningful":[173],"question.":[174],"The":[175,260,317],"most":[176],"general":[177,215],"known":[178],"property":[179,216],"makes":[183],"bounded":[188,205,218],"fractional":[189,219],"hypertree":[190,220],"width.":[191],"Here":[192],"introduce":[194],"new":[196,303,336],"measure":[198],"called":[199],"submodular":[200,206,240,361,382],"width,":[201,241,383],"show":[203,234],"width":[207],"(which":[210],"strictly":[213],"more":[214],"width)":[221],"implies":[222],"tractable.":[227],"matching":[230],"hardness":[231,365],"result,":[232,366],"has":[238,380],"tractable":[247],"(and":[248],"hence":[249],"solvable),":[252],"unless":[253],"Exponential":[255],"Time":[256],"Hypothesis":[257],"(ETH)":[258],"fails.":[259],"algorithmic":[261],"result":[262],"uses":[263],"tree":[264,311],"decompositions":[265],"novel":[268],"way:":[269],"instead":[270],"using":[272],"single":[274],"decomposition":[275,312],"depending":[276],"hypergraph,":[279],"instance":[281,387,395],"split":[283],"into":[284],"set":[286,293],"(all":[289],"same":[292],"as":[296],"original":[298],"instance),":[299],"solved":[306],"choosing":[308],"different":[310],"them.":[316],"reason":[318],"why":[319],"strategy":[321],"works":[322],"splitting":[326],"can":[327,356,388],"done":[329],"such":[331],"way":[333],"\"uniform\"":[339],"respect":[341],"extensions":[345],"partial":[347,354],"solutions,":[348],"therefore":[350],"solutions":[355],"described":[358],"function.":[362],"prove":[368,401],"via":[369],"series":[371],"combinatorial":[373,403],"results":[374],"large":[381],"3SAT":[386],"efficiently":[390],"simulated":[391],"To":[400],"these":[402],"results,":[404],"need":[406],"develop":[408],"theory":[410],"(multicommodity)":[412],"flows":[413],"vertex":[417],"separators":[418],"case":[421],"when":[422],"function":[424],"b(S)":[425],"defining":[426],"cost":[428],"separator":[430],"S":[431],"submodular.":[433]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":11}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}