Jari J. H. de Kroon

J. Comput. Syst. Sci., December, 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

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

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

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

[BibT_eX]

[DOI]

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2022

Finding k-Secluded Trees Faster.

[BibT_eX]

[DOI]

Huib Donkers

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Search-Space Reduction via Essential Vertices.

[BibT_eX]

[DOI]

Benjamin Merlin Bumpus

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

Vertex deletion parameterized by elimination distance and even less.

[BibT_eX]

[DOI]