Jari J. H. de Kroon

collaborators

2 papers

cs.DS2023

Single-Exponential FPT Algorithms for Enumerating Secluded $F$ -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 $(S, T)$ -separators in a graph which are 'farthest from $S$ ' in a technical sense. In this paper, we introdu…

cs.DS2023

5-Approximation for $H$ -Treewidth Essentially as Fast as $H$ -Deletion Parameterized by Solution Size

Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk

The notion of $H$ -treewidth, where $H$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly…

Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes

5-Approximation for H-Treewidth Essentially as Fast as H-Deletion Parameterized by Solution Size

Single-Exponential FPT Algorithms for Enumerating Secluded $F$ -Free Subgraphs and Deleting to Scattered Graph Classes

5-Approximation for $H$ -Treewidth Essentially as Fast as $H$ -Deletion Parameterized by Solution Size