1 citations · 2 across the 6 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.CC2023
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
Jacob Focke, Florian Hörsch, Shaohua Li +1
The Multicut problem asks for a minimum cut separating certain pairs of vertices: formally, given a graph and demand graph on a set of terminals, the task…
cs.CC2023★ 1 cited
Counting Small Induced Subgraphs with Edge-monotone Properties
Simon Döring, Dániel Marx, Philip Wellnitz
We study the parameterized complexity of #IndSub(), where given a graph and an integer , the task is to count the number of induced subgraphs on vertices that satisfy…
cs.CC2023★ 1 cited
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
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…