14 citations · 22 across the 12 of their papers we have counts for
4 papers · 1 filter
On the Parameterized Complexity of Multiway Near-Separator
Bart M. P. Jansen, Shivesh K. Roy
We study a new graph separation problem called Multiway Near-Separator. Given an undirected graph , integer , and terminal set , it asks whether there is a…
Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions
Bart M. P. Jansen, Bart van der Steenhoven
A kernelization for a parameterized decision problem is a polynomial-time preprocessing algorithm that reduces any parameterized instance into an instance $(x…
Single-Exponential FPT Algorithms for Enumerating Secluded -Free Subgraphs and Deleting to Scattered Graph Classes
Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
The celebrated notion of important separators bounds the number of small -separators in a graph which are 'farthest from ' in a technical sense. In this paper, we introdu…
5-Approximation for -Treewidth Essentially as Fast as -Deletion Parameterized by Solution Size
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
The notion of -treewidth, where is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly…