5 citations · 9 across the 6 of their papers we have counts for
1 paper · 2 filters
Jacob Focke, Dániel Marx, Fionn Mc Inerney +4
For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets σ,ρ of non-negative…