Schepper, Philipp

1. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
   2022/11/08 by Focke, Jacob, Marx, Dániel, Inerney, Fionn Mc +4 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
   2023/05/26 by Focke, Jacob, Marx, Dániel, Inerney, Fionn Mc +4 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #G.2.1