Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Exploring Minimal Blocking Sets for Kernelization Lower Bounds for -Minor Deletion
Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann
For Vertex Cover, a minimal blocking set of a graph is an inclusion-wise minimal vertex set contained in no minimum vertex cover of . Bougeret et al. [SIDMA 2022] showed tha…
cs.DS2026
Faster Exponential Algorithms for Multi-Machine Scheduling Problems
Anubhav Dhar, Anita Dürr, Ahmed Ghazy +2
Minimizing the weighted completion times () and weighted number of tardy jobs () on multiple identical machines are two classical NP-har…
cs.DS2026
Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth- Deletion
Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann +1
For a constant , Pathwidth- Deletion is the problem of deciding whether, for a given graph and integer , there is a set of size at most su…