Jari J. H. de Kroon

Orcid: 0000-0003-3328-9712

According to our database1, Jari J. H. de Kroon authored at least 10 papers between 2021 and 2025.

Collaborative distances:

Timeline

2021
2022
2023
2024
2025
0
1
2
3
4
5
1
1
3
1
1
1
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes.
J. Comput. Syst. Sci., 2025

2024
Search-Space Reduction via Essential Vertices.
SIAM J. Discret. Math., 2024

2023
Deletion to scattered graph classes I - Case of finite number of graph classes.
J. Comput. Syst. Sci., December, 2023

Finding <i>k</i>-secluded trees faster.
J. Comput. Syst. Sci., December, 2023

5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size.
CoRR, 2023

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies.
J. Comput. Syst. Sci., 2022

Finding k-Secluded Trees Faster.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2021
FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Vertex deletion parameterized by elimination distance and even less.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021


  Loading...