{"id":"https://openalex.org/W4406962992","doi":"https://doi.org/10.1145/3708509","title":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results","display_name":"Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results","publication_year":2025,"publication_date":"2025-01-30","ids":{"openalex":"https://openalex.org/W4406962992","doi":"https://doi.org/10.1145/3708509"},"language":"en","primary_location":{"id":"doi:10.1145/3708509","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3708509","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3708509","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":false,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany","CISPA Helmholtz Center for Information Security,  Saarbrucken, 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,  Saarbrucken, 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,  Saarbrucken 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,  Saarbrucken 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, Vienna 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, Vienna 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,  Saarbrucken 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,  Saarbrucken 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, United States","Duke University,  Durham, United States"],"raw_orcid":"https://orcid.org/0000-0002-7443-9599","affiliations":[{"raw_affiliation_string":"Duke University, Durham, United States","institution_ids":["https://openalex.org/I170897317"]},{"raw_affiliation_string":"Duke University,  Durham, United States","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,  Saarbrucken 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,  Saarbrucken 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, Tokyo Japan and The Graduate University for Advanced Studies, Tokyo, Japan","National Institute of Informatics,  Tokyo Japan","The Graduate University for Advanced Studies,  Tokyo Japan"],"raw_orcid":"https://orcid.org/0000-0002-6482-8478","affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo Japan and The Graduate University for Advanced Studies, Tokyo, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"National Institute of Informatics,  Tokyo Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"The Graduate University for Advanced Studies,  Tokyo Japan","institution_ids":["https://openalex.org/I200475212"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7964,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71147811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"17","issue":"2","first_page":"1","last_page":"101"},"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.9987000226974487,"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.9976000189781189,"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.9171563386917114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7332338094711304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6686170101165771},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6504687666893005},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5694350600242615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5351684093475342},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.5240709781646729},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.46173059940338135},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4071108102798462},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3383738398551941},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27846354246139526},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07835051417350769}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9171563386917114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7332338094711304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6686170101165771},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6504687666893005},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5694350600242615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5351684093475342},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.5240709781646729},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.46173059940338135},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4071108102798462},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3383738398551941},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27846354246139526},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07835051417350769},{"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/3708509","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3708509","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3708509","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3708509","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"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 Transactions on Computation Theory","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1494208392","https://openalex.org/W1586904125","https://openalex.org/W1972514464","https://openalex.org/W1991755800","https://openalex.org/W2016056456","https://openalex.org/W2106353099","https://openalex.org/W2143406303","https://openalex.org/W2602820822","https://openalex.org/W2789288165","https://openalex.org/W2789507435","https://openalex.org/W2800485060","https://openalex.org/W2914414140","https://openalex.org/W2963282263","https://openalex.org/W2964157411","https://openalex.org/W2964301480","https://openalex.org/W3017735120","https://openalex.org/W3082547133","https://openalex.org/W3139078859","https://openalex.org/W3141446590","https://openalex.org/W3160700943","https://openalex.org/W3179983905","https://openalex.org/W4237554979","https://openalex.org/W4238913085","https://openalex.org/W4308671835","https://openalex.org/W4319654138"],"related_works":["https://openalex.org/W2029854525","https://openalex.org/W1976784955","https://openalex.org/W2889180046","https://openalex.org/W2012687409","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W1976463682","https://openalex.org/W1544821268","https://openalex.org/W2567822775","https://openalex.org/W2113901576"],"abstract_inverted_index":{"For":[0,20,205],"a":[1,27,31,35,64,68,122,137,184],"well-studied":[2],"family":[3],"of":[4,24,30,38,62,99,125,169,194],"domination-type":[5],"problems,":[6],"in":[7,114,130,155,226],"bounded-treewidth":[8],"graphs,":[9],"we":[10,150],"investigate":[11],"whether":[12],"it":[13,92],"is":[14,34,93,107,128,136,177],"possible":[15],"to":[16,216],"find":[17],"faster":[18],"algorithms.":[19],"sets":[21,103,173,207],"\u03c2,":[22,134],"\u03c1":[23,135],"non-negative":[25],"integers,":[26],"(\u03c3,":[28,65,104,112,167,195],"\u03c1)-set":[29,66],"graph":[32],"G":[33],"set":[36],"S":[37,49],"vertices":[39],"such":[40],"that":[41,110,152,221],"\\(|N(u)\\cap":[42],"S|\\in":[43,53],"\\sigma\\)":[44],"for":[45,55,96,164],"every":[46,56],"u":[47],"\u2208":[48],",":[50,77,80,84],"and":[51,85,145,179,209],"\\(|N(v)\\cap":[52],"\\rho\\)":[54],"\\(v\\not\\in":[57],"S\\)":[58],".":[59],"The":[60],"problem":[61,176],"finding":[63],"(of":[67],"certain":[69],"size)":[70],"unifies":[71],"common":[72],"problems":[73],"like":[74],"Independent":[75,81],"Set":[76,79,83],"Dominating":[78,82],"many":[86],"others.":[87],"In":[88],"an":[89,108,140],"accompanying":[90,157],"article,":[91],"proven":[94],"that,":[95],"all":[97],"pairs":[98],"finite":[100,170,206],"or":[101,171],"cofinite":[102,172],"\u03c1),":[105],"there":[106],"algorithm":[109],"counts":[111],"\u03c1)-sets":[113,196],"time":[115],"\\((c_{\\sigma":[116,185],",\\rho":[117,186],"})^{\\sf":[118],"tw}\\cdot":[119,188],"n^{O(1)}\\)":[120,189],"(if":[121],"tree":[123],"decomposition":[124],"width":[126],"tw":[127],"given":[129],"the":[131,153,156,175,192,199,217],"input).":[132],"Here,":[133],"constant":[138],"with":[139],"intricate":[141],"dependency":[142],"on":[143],"\u03c2":[144,208],"\u03c1.":[146],"Despite":[147],"this":[148,227],"intricacy,":[149],"show":[151],"algorithms":[154,223],"article":[158],"are":[159,224],"most":[160],"likely":[161],"optimal,":[162],"i.e.,":[163],"any":[165,180],"pair":[166],"\u03c1)":[168],"where":[174],"non-trivial,":[178],"\u025b":[181],">":[182],"0,":[183],"}-\\varepsilon)^{\\sf":[187],"-algorithm":[190],"counting":[191],"number":[193],"would":[197],"violate":[198],"Counting":[200],"Strong":[201],"Exponential-Time":[202],"Hypothesis":[203],"(#SETH).":[204],"\u03c1,":[210],"our":[211],"lower":[212],"bounds":[213],"also":[214],"extend":[215],"decision":[218],"version,":[219],"showing":[220],"those":[222],"optimal":[225],"setting":[228],"as":[229],"well.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}