Dániel Marx

activity

20242026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

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…

cs.DS2026

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs

Jakob Greilhuber, DÃ¡niel Marx

For fixed sets $I ¨ , I ¨ $ of non-negative integers, the $(I ¨ , I ¨ )$ -domination framework introduced by Telle [Nord. J. Comput. 1994] captures many classical graph problems. For a grap…

cs.DS2025

Generalized Graph Packing Problems Parameterized by Treewidth

BarÄ±Å Can Esmer, DÃ¡niel Marx

$H$ -Packing is the problem of finding a maximum number of vertex-disjoint copies of $H$ in a given graph $G$ . $H$ -Partition is the special case of finding a set of vertex-disjoint…