Vertex deletion parameterized by elimination distance and even less. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (STOC, 2021)

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. - Bart M. P. Jansen; Jari J. H. de Kroon (WG, 2021)

Finding k-Secluded Trees Faster. - Huib Donkers; Bart M. P. Jansen; Jari J. H. de Kroon (WG, 2022)

Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies. - Bart M. P. Jansen; Jari J. H. de Kroon (J. Comput. Syst. Sci., 2022)

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (ESA, 2023)

5-Approximation for $ mathcal{H}$-Treewidth Essentially as Fast as $ mathcal{H}$-Deletion Parameterized by Solution Size. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (CoRR, 2023)

Finding k-secluded trees faster. - Huib Donkers; Bart M. P. Jansen; Jari J. H. de Kroon (J. Comput. Syst. Sci., 2023)

Deletion to scattered graph classes I - Case of finite number of graph classes. - Ashwin Jacob; Jari J. H. de Kroon; Diptapriyo Majumdar; Venkatesh Raman 001 (J. Comput. Syst. Sci., 2023)

Search-Space Reduction via Essential Vertices. - Benjamin Merlin Bumpus; Bart M. P. Jansen; Jari J. H. de Kroon (SIAM J. Discret. Math., 2024)

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; Michal Wlodarczyk 001 (J. Comput. Syst. Sci., 2025)