{"id":"https://openalex.org/W2065023965","doi":"https://doi.org/10.1145/1568318.1568320","title":"Generalized hypertree decompositions: NP-hardness and tractable variants","display_name":"Generalized hypertree decompositions: NP-hardness and tractable variants","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W2065023965","doi":"https://doi.org/10.1145/1568318.1568320","mag":"2065023965"},"language":"en","primary_location":{"id":"doi:10.1145/1568318.1568320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1568318.1568320","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/141030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Oxford University, Parks Road, Oxford","Oxford Univ., Parks Road, Oxford#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Oxford University, Parks Road, Oxford","institution_ids":["https://openalex.org/I40120149"]},{"raw_affiliation_string":"Oxford Univ., Parks Road, Oxford#TAB#","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108802826","display_name":"Zolt\u00e1n Mikl\u00f3s","orcid":"https://orcid.org/0000-0002-3701-6263"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Mikl\u00f3s","raw_affiliation_strings":["\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland","Ecole Polytechnique Federale de Lausanne (Switzerland)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]},{"raw_affiliation_string":"Ecole Polytechnique Federale de Lausanne (Switzerland)","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031710345","display_name":"Thomas Schwentick","orcid":"https://orcid.org/0000-0002-1062-922X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Schwentick","raw_affiliation_strings":["Technische Universit\u00e4t Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7361,"has_fulltext":false,"cited_by_count":108,"citation_normalized_percentile":{"value":0.97123987,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"56","issue":"6","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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.9983000159263611,"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.9944000244140625,"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.9829999804496765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.9414386749267578},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9161683917045593},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7118978500366211},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.59580397605896},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4791519045829773},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4611549377441406},{"id":"https://openalex.org/keywords/conjunctive-query","display_name":"Conjunctive query","score":0.4526994228363037},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44089072942733765},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4341356158256531},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.42173928022384644},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16854679584503174},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1399964988231659}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.9414386749267578},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9161683917045593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7118978500366211},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.59580397605896},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4791519045829773},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4611549377441406},{"id":"https://openalex.org/C65647387","wikidata":"https://www.wikidata.org/wiki/Q1781706","display_name":"Conjunctive query","level":3,"score":0.4526994228363037},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44089072942733765},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4341356158256531},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.42173928022384644},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16854679584503174},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1399964988231659},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.0},{"id":"https://openalex.org/C206352148","wikidata":"https://www.wikidata.org/wiki/Q209306","display_name":"Hyperbolic geometry","level":3,"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/C192939610","wikidata":"https://www.wikidata.org/wiki/Q188444","display_name":"Differential geometry","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1568318.1568320","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1568318.1568320","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:infoscience.epfl.ch:141030","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/141030","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:1fe7857b-8380-4ce7-803c-dae5f29c558d","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:1fe7857b-8380-4ce7-803c-dae5f29c558d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements at Oxford","raw_type":"Journal article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:5f9b52b2-165e-4c90-88ef-025339719107","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Conference item"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:141030","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/141030","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1096822423","display_name":"Schema Mappings and Automated Services for Data Integration and Exchange","funder_award_id":"EP/E010865/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G5343026624","display_name":null,"funder_award_id":"EP/E010865/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G598941964","display_name":null,"funder_award_id":"P17222-N04","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W52840101","https://openalex.org/W156119379","https://openalex.org/W1527664624","https://openalex.org/W1530765221","https://openalex.org/W1558832481","https://openalex.org/W1774079182","https://openalex.org/W1957035253","https://openalex.org/W1978452004","https://openalex.org/W1979514837","https://openalex.org/W1984868905","https://openalex.org/W2004485491","https://openalex.org/W2020608734","https://openalex.org/W2026745535","https://openalex.org/W2026838793","https://openalex.org/W2029095423","https://openalex.org/W2029448190","https://openalex.org/W2033325972","https://openalex.org/W2034501206","https://openalex.org/W2034674470","https://openalex.org/W2045985005","https://openalex.org/W2046652577","https://openalex.org/W2053455138","https://openalex.org/W2057256946","https://openalex.org/W2064796716","https://openalex.org/W2072838038","https://openalex.org/W2075198446","https://openalex.org/W2085443399","https://openalex.org/W2134483537","https://openalex.org/W2140016393","https://openalex.org/W2148417962","https://openalex.org/W2150132485","https://openalex.org/W2153629319","https://openalex.org/W2280659633","https://openalex.org/W2394842790","https://openalex.org/W2401216365","https://openalex.org/W2531563875","https://openalex.org/W2561675875","https://openalex.org/W2628596753","https://openalex.org/W2748837517","https://openalex.org/W2913688336","https://openalex.org/W3004680345","https://openalex.org/W4254380579","https://openalex.org/W4292230561","https://openalex.org/W4387761158","https://openalex.org/W6644394912"],"related_works":["https://openalex.org/W2933667225","https://openalex.org/W2008536061","https://openalex.org/W2280659633","https://openalex.org/W1979091081","https://openalex.org/W2091522522","https://openalex.org/W4302801230","https://openalex.org/W2959649007","https://openalex.org/W4308505582","https://openalex.org/W2009666814","https://openalex.org/W3092761001"],"abstract_inverted_index":{"The":[0],"generalized":[1,142,157],"hypertree":[2,143,158],"width":[3,144],"GHW(":[4,67],"H":[5,10,58,68,125],")":[6,69],"of":[7,14,18,112,182],"a":[8,12,51,123,127,133,170,176,180,186],"hypergraph":[9,57,124,134,152],"is":[11,76,88,115,118,136,167,203],"measure":[13],"its":[15],"cyclicity.":[16],"Classes":[17],"conjunctive":[19],"queries":[20],"or":[21],"constraint":[22],"satisfaction":[23],"problems":[24],"whose":[25],"associated":[26],"hypergraphs":[27],"have":[28],"bounded":[29],"GHW":[30],"are":[31],"known":[32],"to":[33,94,132,185,212],"be":[34,61],"solvable":[35],"in":[36,63,109],"polynomial":[37,64],"time.":[38],"However,":[39],"it":[40,59],"has":[41],"been":[42],"an":[43],"open":[44,100],"problem":[45,75,87],"for":[46,50,82],"several":[47],"years":[48],"if":[49],"fixed":[52],"constant":[53],"k":[54,71,83],"and":[55,106,205],"input":[56],"can":[60],"determined":[62],"time":[65],"whether":[66,122],"\u2264":[70],".":[72],"Here,":[73],"this":[74,95],"settled":[77],"by":[78,104,169],"proving":[79],"that":[80,120,155,163,178],"even":[81],"=":[84],"3":[85],"the":[86,92,110,196],"already":[89],"NP-hard.":[90],"On":[91],"way":[93],"result,":[96],"another":[97],"long":[98],"standing":[99],"problem,":[101],"originally":[102],"raised":[103],"Goodman":[105],"Shmueli":[107],"[1984]":[108],"context":[111],"join":[113],"optimization":[114],"solved.":[116],"It":[117],"proven":[119],"determining":[121],"admits":[126],"tree":[128],"projection":[129],"with":[130],"respect":[131],"G":[135],"NP-complete.":[137],"Our":[138],"intractability":[139],"results":[140],"on":[141,148],"motivate":[145],"further":[146],"research":[147],"more":[149,207],"restrictive":[150],"tractable":[151,171,204],"decomposition":[153,159,172],"methods":[154],"approximate":[156],"(GHD).":[160],"We":[161],"show":[162],"each":[164],"such":[165,192],"method":[166,173],"dominated":[168],"definable":[174],"through":[175],"function":[177],"associates":[179],"set":[181],"partial":[183],"edges":[184],"hypergraph.":[187],"By":[188],"using":[189],"one":[190],"particular":[191],"function,":[193],"we":[194],"define":[195],"new":[197],"Component":[198],"Hypertree":[199],"Decomposition":[200],"method,":[201],"which":[202],"strictly":[206],"general":[208],"than":[209],"other":[210],"approximations":[211],"GHD":[213],"published":[214],"so":[215],"far.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}