1 citations · 1 across the 2 of their papers we have counts for
6 papers
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…
Search-Space Reduction via Essential Vertices
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
We investigate preprocessing for vertex-subset problems on graphs. While the notion of kernelization, originating in parameterized complexity theory, is a formalization of provably…
Finding -Secluded Trees Faster
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
We revisit the \textsc{-Secluded Tree} problem. Given a vertex-weighted undirected graph , its objective is to find a maximum-weight induced subtree whose open neighborho…
Deletion to Scattered Graph Classes I -- case of finite number of graph classes
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar +1
Graph-modification problems, where we modify a graph by adding or deleting vertices or edges or contracting edges to obtain a graph in a {\it simpler} class, is a well-studied opti…
Vertex Deletion Parameterized by Elimination Distance and Even Less
Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk
We study the parameterized complexity of various classic vertex-deletion problems such as Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid para…