1 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
Sándor Kisfaludi-Bak, Dániel Marx
We give approximation schemes for Subset TSP and Steiner Tree on unit disk graphs, and more generally, on intersection graphs of similarly sized connected fat (not necessarily conv…
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…
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…
Hitting Meets Packing: How Hard Can it Be?
Jacob Focke, Fabian Frei, Shaohua Li +4
We study a general family of problems that form a common generalization of classic hitting (also referred to as covering or transversal) and packing problems. An instance of X-HitP…