{"id":"https://openalex.org/W3035551586","doi":"https://doi.org/10.24963/ijcai.2020/263","title":"Threshold Treewidth and Hypertree Width","display_name":"Threshold Treewidth and Hypertree Width","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3035551586","doi":"https://doi.org/10.24963/ijcai.2020/263","mag":"3035551586"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2020/263","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/263","pdf_url":"https://www.ijcai.org/proceedings/2020/0263.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2020/0263.pdf","any_repository_has_fulltext":null},"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":false,"raw_author_name":"Robert Ganian","raw_affiliation_strings":["TU Wien","TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017525048","display_name":"Andr\u00e9 Schidler","orcid":"https://orcid.org/0000-0001-6790-7158"},"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":"Andre Schidler","raw_affiliation_strings":["TU Wien","TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033440939","display_name":"Manuel Sorge","orcid":"https://orcid.org/0000-0001-7394-3147"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Manuel Sorge","raw_affiliation_strings":["University of Warsaw","University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"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","TU Wien, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1898","last_page":"1904"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9664999842643738,"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/treewidth","display_name":"Treewidth","score":0.9172632694244385},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.8704707622528076},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.602509081363678},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6013877987861633},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5768254995346069},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5075312852859497},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5044459104537964},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4832666516304016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48246389627456665},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4586385190486908},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4257078170776367},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41291525959968567},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36452656984329224},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3272992968559265},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28701919317245483},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17723912000656128},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.1465897560119629},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10595327615737915}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9172632694244385},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.8704707622528076},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.602509081363678},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6013877987861633},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5768254995346069},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5075312852859497},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5044459104537964},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4832666516304016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48246389627456665},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4586385190486908},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4257078170776367},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41291525959968567},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36452656984329224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3272992968559265},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28701919317245483},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17723912000656128},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.1465897560119629},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10595327615737915},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2020/263","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/263","pdf_url":"https://www.ijcai.org/proceedings/2020/0263.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2020/263","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2020/263","pdf_url":"https://www.ijcai.org/proceedings/2020/0263.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G29884786","display_name":"Revealing and Utilizing the Hidden Structure for Solving Hard Problems in AI","funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G4424345304","display_name":"SAT-Based Local Improvement Methods (SLIM)","funder_award_id":"P32441","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6483656518","display_name":null,"funder_award_id":"ICT19-065","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8159133586","display_name":"New Frontiers for Parameterized Complexity","funder_award_id":"P31336","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":"Logical Methods in Computer Science","funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3035551586.pdf","grobid_xml":"https://content.openalex.org/works/W3035551586.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W114565888","https://openalex.org/W1009693448","https://openalex.org/W1558184472","https://openalex.org/W1560870503","https://openalex.org/W1572255008","https://openalex.org/W1804601140","https://openalex.org/W1821762897","https://openalex.org/W1858603130","https://openalex.org/W1894390600","https://openalex.org/W1963547452","https://openalex.org/W1982333717","https://openalex.org/W1983648207","https://openalex.org/W1990761146","https://openalex.org/W2021183451","https://openalex.org/W2033325972","https://openalex.org/W2050882124","https://openalex.org/W2057186622","https://openalex.org/W2059372025","https://openalex.org/W2061881283","https://openalex.org/W2080192364","https://openalex.org/W2116087731","https://openalex.org/W2116793595","https://openalex.org/W2147180598","https://openalex.org/W2207672057","https://openalex.org/W2313886575","https://openalex.org/W2480025839","https://openalex.org/W2547902904","https://openalex.org/W2609269940","https://openalex.org/W2888273277","https://openalex.org/W2904358320","https://openalex.org/W2950822337","https://openalex.org/W2995165452","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2628596753","https://openalex.org/W2949978915","https://openalex.org/W2134402143","https://openalex.org/W2480025839","https://openalex.org/W2119213574","https://openalex.org/W2075531723","https://openalex.org/W2945561475","https://openalex.org/W1988026822","https://openalex.org/W2950294966","https://openalex.org/W1973538949"],"abstract_inverted_index":{"Treewidth":[0],"and":[1,53,81,128,131],"hypertree":[2,82,129],"width":[3,72,83,130],"have":[4],"proven":[5],"to":[6,57,94,138],"be":[7,58],"highly":[8],"successful":[9],"structural":[10],"parameters":[11,25,135],"in":[12,35,45,158],"the":[13,16,40,43,46,51,61,91,100,106],"context":[14],"of":[15,23,42,70,79,88,160],"Constraint":[17],"Satisfaction":[18],"Problem":[19],"(CSP).":[20],"When":[21],"either":[22,69],"these":[24,71,113,134],"is":[26,55,63],"bounded":[27],"by":[28,68],"a":[29,85],"constant,":[30],"then":[31],"CSP":[32,108,142],"becomes":[33],"solvable":[34],"polynomial":[36,44],"time.":[37],"However,":[38],"here":[39],"order":[41],"running":[47],"time":[48],"depends":[49],"on":[50,168],"width,":[52],"this":[54],"known":[56],"unavoidable;":[59],"therefore,":[60],"problem":[62],"not":[64],"fixed-parameter":[65,139],"tractable":[66],"parameterized":[67],"measures.":[73],"Here":[74],"we":[75,115],"introduce":[76],"an":[77],"enhancement":[78],"tree":[80],"through":[84],"novel":[86],"notion":[87],"thresholds,":[89],"allowing":[90],"associated":[92,103],"decompositions":[93],"take":[95],"into":[96],"account":[97],"information":[98],"about":[99],"computational":[101],"costs":[102],"with":[104,155],"solving":[105],"given":[107],"instance.":[109],"Aside":[110],"from":[111],"introducing":[112],"notions,":[114],"obtain":[116],"efficient":[117],"theoretical":[118,153],"as":[119,121,143,145,162,164],"well":[120,144,163],"empirical":[122],"algorithms":[123,140],"for":[124,141],"computing":[125],"threshold":[126],"treewidth":[127],"show":[132],"that":[133],"give":[136],"rise":[137],"other,":[146],"more":[147],"general":[148],"problems.":[149],"We":[150],"complement":[151],"our":[152],"results":[154],"experimental":[156],"evaluations":[157],"terms":[159],"heuristics":[161],"exact":[165],"methods":[166],"based":[167],"SAT/SMT":[169],"encodings.":[170]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}