research
∙
09/20/2023
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes
The celebrated notion of important separators bounds the number of small...
share
research
∙
06/29/2023
5-Approximation for â„‹-Treewidth Essentially as Fast as â„‹-Deletion Parameterized by Solution Size
The notion of â„‹-treewidth, where â„‹ is a hereditary graph class, was rece...
research
∙
07/01/2022
Search-Space Reduction via Essential Vertices
We investigate preprocessing for vertex-subset problems on graphs. While...
research
∙
06/20/2022
Finding k-Secluded Trees Faster
We revisit the k-Secluded Tree problem. Given a vertex-weighted undirect...
research
∙
06/08/2021
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
For a hereditary graph class â„‹, the â„‹-elimination distance of a graph G ...
research
∙
05/10/2021
Parameterized Complexity of Deletion to Scattered Graph Classes
Graph-modification problems, where we add/delete a small number of verti...
research
∙
03/17/2021
Vertex Deletion Parameterized by Elimination Distance and Even Less
We study the parameterized complexity of various classic vertex deletion...
research
∙
04/19/2020
