Jari J. H. de Kroon

Publication Activity (10 Years)

Years Active: 2020-2023
Publications (10 Years): 18

Top Topics

Graph Properties

Parameterized Complexity

Minimization Problems

Top Venues

J. Comput. Syst. Sci.

Publications

Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
-secluded trees faster. J. Comput. Syst. Sci. 138 (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA (2023)
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Deletion to scattered graph classes I - Case of finite number of graph classes. J. Comput. Syst. Sci. 138 (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR (2023)
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Finding k-Secluded Trees Faster. WG (2022)
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices. ESA (2022)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies. J. Comput. Syst. Sci. 126 (2022)
Benjamin Merlin Bumpus, Bart M. P. Jansen, Jari J. H. de Kroon
Search-Space Reduction via Essential Vertices. CoRR (2022)
Huib Donkers, Bart M. P. Jansen, Jari J. H. de Kroon
Finding k-Secluded Trees Faster. CoRR (2022)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR (2021)
Bart M. P. Jansen, Jari J. H. de Kroon
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. CoRR (2021)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex deletion parameterized by elimination distance and even less. STOC (2021)
Ashwin Jacob, Jari J. H. de Kroon, Diptapriyo Majumdar, Venkatesh Raman
Parameterized Complexity of Deletion to Scattered Graph Classes. CoRR (2021)
Bart M. P. Jansen, Jari J. H. de Kroon
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. WG (2021)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. SWAT (2020)
Bart M. P. Jansen, Jari J. H. de Kroon
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies. CoRR (2020)