b'@article{Focke24,'b"\nTITLE = {Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part {II}: {H}ardness Results},\nAUTHOR = {Focke, Jacob and Marx, D{\\'a}niel and Mc Inerney, Fionn and Neuen, Daniel and Sankar, Govind S. and Schepper, Philipp and Wellnitz, Philip},\nLANGUAGE = {eng},\nISSN = {1942-3462},\nDOI = {10.1145/3708509},\nPUBLISHER = {ACM},\nADDRESS = {New York, NY},\nYEAR = {2025},\nMARGINALMARK = {$\\bullet$},\nDATE = {2025},\nJOURNAL = {ACM Transactions on Computation Theory},\nVOLUME = {17},\nNUMBER = {2},\nPAGES = {1--101},\nEID = {10},\n}\n"