{"id":"https://openalex.org/W4313250736","doi":"https://doi.org/10.1145/3578266","title":"Incremental Updates of Generalized Hypertree Decompositions","display_name":"Incremental Updates of Generalized Hypertree Decompositions","publication_year":2022,"publication_date":"2022-12-27","ids":{"openalex":"https://openalex.org/W4313250736","doi":"https://doi.org/10.1145/3578266"},"language":"en","primary_location":{"id":"doi:10.1145/3578266","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3578266","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3578266","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3578266","any_repository_has_fulltext":false},"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":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053864834","display_name":"Matthias Lanzinger","orcid":"https://orcid.org/0000-0002-7601-3727"},"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":"Matthias Lanzinger","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022438803","display_name":"Davide Mario Longo","orcid":"https://orcid.org/0000-0003-4018-4994"},"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":"Davide Mario Longo","raw_affiliation_strings":["TU Wien, Favoritenstra\u00dfe, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Favoritenstra\u00dfe, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003919374","display_name":"Cem Okulmus","orcid":"https://orcid.org/0000-0002-7742-0439"},"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":"Cem Okulmus","raw_affiliation_strings":["TU Wien, Favoritenstra\u00dfe, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Favoritenstra\u00dfe, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.2854,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59874812,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"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.9991000294685364,"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.9713000059127808,"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/T11041","display_name":"Ubiquitin and proteasome pathways","score":0.9631999731063843,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.8780824542045593},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.7936726808547974},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6973937749862671},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.5929672122001648},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5847234725952148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543306291103363},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5422803163528442},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4973945915699005},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.46058031916618347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4510934352874756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40033718943595886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.327725887298584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.14431247115135193}],"concepts":[{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.8780824542045593},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7936726808547974},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6973937749862671},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.5929672122001648},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5847234725952148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543306291103363},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5422803163528442},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4973945915699005},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.46058031916618347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4510934352874756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40033718943595886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.327725887298584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14431247115135193},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3578266","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3578266","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3578266","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3578266","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3578266","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3578266","source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1975729292","display_name":null,"funder_award_id":"W1255-N23","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G3867201627","display_name":null,"funder_award_id":"P30930","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G6631213480","display_name":null,"funder_award_id":"P30930-N35","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8184292771","display_name":null,"funder_award_id":"Project","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8680849391","display_name":null,"funder_award_id":"W1255","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313250736.pdf","grobid_xml":"https://content.openalex.org/works/W4313250736.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W2008134141","https://openalex.org/W2008865455","https://openalex.org/W2021989496","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2053637323","https://openalex.org/W2065023965","https://openalex.org/W2066814802","https://openalex.org/W2111829945","https://openalex.org/W2118382442","https://openalex.org/W2143238590","https://openalex.org/W2166566648","https://openalex.org/W2218651731","https://openalex.org/W2547902904","https://openalex.org/W2608239929","https://openalex.org/W2888273277","https://openalex.org/W2915063781","https://openalex.org/W2916965296","https://openalex.org/W2963560792","https://openalex.org/W3034450786","https://openalex.org/W3035604152","https://openalex.org/W3090551372","https://openalex.org/W3101089670","https://openalex.org/W3178614413","https://openalex.org/W3189930236","https://openalex.org/W3200757673","https://openalex.org/W4206279791"],"related_works":["https://openalex.org/W2252314269","https://openalex.org/W2397006633","https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2380722038","https://openalex.org/W1978282744","https://openalex.org/W118329590"],"abstract_inverted_index":{"Structural":[0],"decomposition":[1,78,89],"methods,":[2],"such":[3],"as":[4],"generalized":[5,120],"hypertree":[6,121],"decompositions,":[7],"have":[8],"been":[9],"successfully":[10],"used":[11],"for":[12,117],"solving":[13,72],"constraint":[14,29],"satisfaction":[15],"problems":[16],"(CSPs).":[17],"As":[18],"decompositions":[19,36],"can":[20],"be":[21],"reused":[22],"to":[23,50],"solve":[24],"CSPs":[25],"with":[26],"the":[27,41,58,68,73,77,105],"same":[28],"scopes,":[30],"investing":[31],"resources":[32],"in":[33,109],"computing":[34],"good":[35],"is":[37,44,107],"beneficial,":[38],"even":[39,56],"though":[40,104],"computation":[42],"itself":[43],"hard.":[45],"Unfortunately,":[46],"current":[47],"methods":[48],"need":[49],"compute":[51],"a":[52,80,87,91,115],"completely":[53],"new":[54,92],"decomposition,":[55],"if":[57],"scopes":[59],"change":[60],"only":[61],"slightly.":[62],"In":[63],"this":[64],"article,":[65],"we":[66,111],"make":[67],"first":[69],"steps":[70],"toward":[71],"problem":[74,106],"of":[75,79,90,100,126],"updating":[76,119],"CSP":[81,93],"P":[82,94,101],"so":[83],"that":[84],"it":[85],"becomes":[86],"valid":[88],"'":[95],"produced":[96],"by":[97],"some":[98],"modification":[99],".":[102],"Even":[103],"hard":[108],"theory,":[110],"propose":[112],"and":[113],"implement":[114],"framework":[116],"effectively":[118],"decompositions.":[122],"The":[123],"experimental":[124],"evaluation":[125],"our":[127],"algorithm":[128],"strongly":[129],"suggests":[130],"practical":[131],"applicability.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}