1 citations · 2 across the 6 of their papers we have counts for
Showing 2025 · cs.DSShow all
2 papers · 2 filters
cs.DS2025
Generalized Graph Packing Problems Parameterized by Treewidth
Barış Can Esmer, Dániel Marx
-Packing is the problem of finding a maximum number of vertex-disjoint copies of in a given graph . -Partition is the special case of finding a set of vertex-disjoint…
cs.DS2025
The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
Jakob Greilhuber, Dániel Marx
For fixed sets of non-negative integers, the -domination framework introduced by Telle [Nord. J. Comput. 1994] captures many classical graph problems. For a graph $G…