2 papers
cs.DS2026
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
BarıŠCan Esmer, Ariel Kulik, Dániel Marx +2
We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J. ACM 2019], by establishing a connection between parameterized approximation and expon…
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…