Showing cs.DSShow all
2 papers · 1 filter
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.DS2024
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
Barış Can Esmer, Ariel Kulik
In this paper we introduce Sampling with a Black Box, a generic technique for the design of parameterized approximation algorithms for vertex deletion problems (e.g., Vertex Cover,…