{"id":"https://openalex.org/W4409643765","doi":"https://doi.org/10.1145/3731452","title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs\u2014Part I: Algorithmic Results","display_name":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs\u2014Part I: Algorithmic Results","publication_year":2025,"publication_date":"2025-04-21","ids":{"openalex":"https://openalex.org/W4409643765","doi":"https://doi.org/10.1145/3731452"},"language":"en","primary_location":{"id":"doi:10.1145/3731452","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3731452","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/A5002287702","display_name":"Jacob Focke","orcid":"https://orcid.org/0000-0002-6895-755X"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","CISPA Helmholtz Center for Information Security, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6895-755X","affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]},{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012849997","display_name":"D\u00e1niel Marx","orcid":"https://orcid.org/0000-0002-5686-8314"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D\u00e1niel Marx","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","CISPA Helmholtz Center for Information Security, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5686-8314","affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]},{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073087000","display_name":"Fionn Mc Inerney","orcid":"https://orcid.org/0000-0002-5634-9506"},"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":"Fionn Mc Inerney","raw_affiliation_strings":["Algorithms and Complexity Group, TU Wien, Vienna, Austria","Algorithms and Complexity Group, TU Wien, Austria"],"raw_orcid":"https://orcid.org/0000-0002-5634-9506","affiliations":[{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Algorithms and Complexity Group, TU Wien, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008306814","display_name":"Daniel Neuen","orcid":"https://orcid.org/0000-0002-4940-0318"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Daniel Neuen","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","Max Planck Institute for Informatics, Saarland Informatics Campus, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4940-0318","affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarland Informatics Campus, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059269053","display_name":"Govind S. Sankar","orcid":"https://orcid.org/0000-0002-7443-9599"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Govind S. Sankar","raw_affiliation_strings":["Duke University, Durham, North Carolina, USA","Duke University, US"],"raw_orcid":"https://orcid.org/0000-0002-7443-9599","affiliations":[{"raw_affiliation_string":"Duke University, Durham, North Carolina, USA","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Duke University, US","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084409924","display_name":"Philipp Schepper","orcid":"https://orcid.org/0000-0002-5810-7949"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Philipp Schepper","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","CISPA Helmholtz Center for Information Security, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5810-7949","affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210128801"]},{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030374322","display_name":"Philip Wellnitz","orcid":"https://orcid.org/0000-0002-6482-8478"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]},{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Philip Wellnitz","raw_affiliation_strings":["National Institute of Informatics, and The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan","National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI, Japan"],"raw_orcid":"https://orcid.org/0000-0002-6482-8478","affiliations":[{"raw_affiliation_string":"National Institute of Informatics, and The Graduate University for Advanced Studies, SOKENDAI, Tokyo, Japan","institution_ids":["https://openalex.org/I200475212"]},{"raw_affiliation_string":"National Institute of Informatics and The Graduate University for Advanced Studies, SOKENDAI, Japan","institution_ids":["https://openalex.org/I184597095","https://openalex.org/I200475212"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5002287702"],"corresponding_institution_ids":["https://openalex.org/I4210128801"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08823454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"3","first_page":"1","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9980999827384949,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9972000122070312,"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.8895684480667114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.689063549041748},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6630603075027466},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6366920471191406},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.558189868927002},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5303184390068054},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5163196921348572},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.48844900727272034},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.42756712436676025},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3883090019226074},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.33024862408638},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2890903949737549},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.11414709687232971},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07106029987335205}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8895684480667114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.689063549041748},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6630603075027466},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6366920471191406},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.558189868927002},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5303184390068054},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5163196921348572},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.48844900727272034},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.42756712436676025},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3883090019226074},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.33024862408638},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2890903949737549},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.11414709687232971},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07106029987335205},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3731452","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3731452","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W1494208392","https://openalex.org/W1579510955","https://openalex.org/W1580414818","https://openalex.org/W1586904125","https://openalex.org/W1804016314","https://openalex.org/W1972514464","https://openalex.org/W1991755800","https://openalex.org/W2002722727","https://openalex.org/W2008440715","https://openalex.org/W2016056456","https://openalex.org/W2028357390","https://openalex.org/W2030506634","https://openalex.org/W2045326192","https://openalex.org/W2045749371","https://openalex.org/W2052354073","https://openalex.org/W2055916047","https://openalex.org/W2062254875","https://openalex.org/W2064310439","https://openalex.org/W2067264828","https://openalex.org/W2106353099","https://openalex.org/W2127485201","https://openalex.org/W2143406303","https://openalex.org/W2145145566","https://openalex.org/W2149785904","https://openalex.org/W2154682992","https://openalex.org/W2156840525","https://openalex.org/W2158584754","https://openalex.org/W2602820822","https://openalex.org/W2789288165","https://openalex.org/W2789819963","https://openalex.org/W2800485060","https://openalex.org/W2914414140","https://openalex.org/W2963282263","https://openalex.org/W2963987338","https://openalex.org/W2964157411","https://openalex.org/W2964301480","https://openalex.org/W3017735120","https://openalex.org/W3039254663","https://openalex.org/W3082547133","https://openalex.org/W3116253690","https://openalex.org/W3139078859","https://openalex.org/W3141446590","https://openalex.org/W3160700943","https://openalex.org/W3177271366","https://openalex.org/W3206264654","https://openalex.org/W4205630623","https://openalex.org/W4237554979","https://openalex.org/W4238913085","https://openalex.org/W4316652445","https://openalex.org/W4379924839","https://openalex.org/W4390918625"],"related_works":["https://openalex.org/W1976784955","https://openalex.org/W2029854525","https://openalex.org/W2889180046","https://openalex.org/W2012687409","https://openalex.org/W1585579706","https://openalex.org/W2091382007","https://openalex.org/W2567822775","https://openalex.org/W1976463682","https://openalex.org/W2803227791","https://openalex.org/W143512583"],"abstract_inverted_index":{"We":[0],"investigate":[1],"how":[2],"efficiently":[3],"a":[4,22,26,30,56,60,117,190],"well-studied":[5],"family":[6],"of":[7,19,25,33,54,84,120,135],"domination-type":[8],"problems":[9],"can":[10],"be":[11],"solved":[12],"on":[13],"bounded-treewidth":[14],"graphs.":[15],"For":[16,81],"sets":[17,88],"\\(\\sigma,\\rho\\)":[18],"non-negative":[20],"integers,":[21],"\\((\\sigma,\\rho)\\)":[23,57,89,110,183,221,236],"-set":[24,58],"graph":[27],"G":[28],"is":[29,105,123,139,149,153,161,184,189,222,237],"set":[31],"S":[32],"vertices":[34],"such":[35,66,102,193],"that":[36,103,108,182,194],"\\(|N(u)\\cap":[37],"S|\\in\\sigma\\)":[38],"for":[39,47,156,226,243],"every":[40,48,195,205],"\\(u\\in":[41],"S\\)":[42,50],",":[43,70,73,77,90,179,203,230,247],"and":[44,78,204,248],"\\(|N(\\!\\textit{v})\\cap":[45],"S|\\in\\rho\\)":[46],"\\(\\textit{v}\\not\\in":[49],".":[51,158,213],"The":[52],"problem":[53],"finding":[55],"(of":[59],"certain":[61],"size)":[62],"unifies":[63],"standard":[64,94],"problems,":[65],"as":[67],"Independent":[68,74],"Set":[69,72,76],"Dominating":[71,75],"many":[79],"others.":[80],"all":[82],"pairs":[83],"finite":[85],"or":[86,141],"cofinite":[87],"we":[91,180],"determine":[92],"(under":[93],"complexity":[95],"assumptions)":[96],"the":[97,126,132,142,166],"best":[98],"possible":[99],"value":[100],"\\(c_{\\sigma,\\rho}\\)":[101,160,178],"there":[104,188],"an":[106],"algorithm":[107],"counts":[109],"-sets":[111],"in":[112,125,197,207],"time":[113],"\\(c_{\\sigma,\\rho}^{\\textsf{tw}}\\cdot":[114],"n^{O(1)}\\)":[115],"(if":[116],"tree":[118],"decomposition":[119],"width":[121],"\\(\\textsf{tw}\\)":[122],"given":[124],"input).":[127],"Let":[128],"\\(s_{{\\rm":[129,169],"top}}\\)":[130,152],"denote":[131],"largest":[133,143],"element":[134],"\\(\\sigma\\)":[136,138,148,198],"if":[137,147,187,220,235],"finite,":[140],"missing":[144],"integer":[145,196,206],"\\(+1\\)":[146],"cofinite;":[150],"\\(r_{{\\rm":[151],"defined":[154],"analogously":[155],"\\(\\rho\\)":[157,208],"Surprisingly,":[159],"often":[162],"significantly":[163],"smaller":[164],"than":[165],"natural":[167],"bound":[168],"top}}+r_{{\\rm":[170,218],"top}}+2\\)":[171,219],"achieved":[172],"by":[173],"existing":[174],"algorithms.":[175],"Toward":[176],"defining":[177],"say":[181],"\\({\\mathrm{m}}\\)":[185,202,212,224,241],"-structured":[186,225,242],"pair":[191],"\\((\\alpha,\\beta)\\)":[192],"equals":[199,209],"\\(\\alpha\\)":[200],"mod":[201,211],"\\(\\beta\\)":[210],"Then,":[214],"setting":[215],"\u2014":[216,231],"\\(c_{\\sigma,\\rho}=s_{{\\rm":[217],"not":[223,240],"any":[227,244],"\\({\\mathrm{m}}\\geq":[228,245],"2\\)":[229],"\\(c_{\\sigma,\\rho}=\\max\\{s_{{\\rm":[232],"top}},r_{{\\rm":[233],"top}}\\}+2\\)":[234],"2-structured,":[238],"but":[239],"3\\)":[246],"<jats:inli":[249]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-04-22T00:00:00"}