E-LIB Suche - Ergebnisse für: de Kroon, Jari J.H.

1

Deletion to scattered graph classes I - Case of finite numb..:

Jacob, Ashwin ; de Kroon, Jari J.H. ; Majumdar, Diptapriyo.
Journal of Computer and System Sciences. 138 (2023) - p. 103460 , 2023

Link: https://doi.org/10.1016/..

2

Finding k-secluded trees faster:

Donkers, Huib ; Jansen, Bart M.P. ; de Kroon, Jari J.H.
Journal of Computer and System Sciences. 138 (2023) - p. 103461 , 2023

Link: https://doi.org/10.1016/..

3

Preprocessing vertex-deletion problems: Characterizing grap..:

Jansen, Bart M.P. ; de Kroon, Jari J.H.
Journal of Computer and System Sciences. 126 (2022) - p. 59-79 , 2022

Link: https://doi.org/10.1016/..

4

Finding k-Secluded Trees Faster:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Donkers, Huib ; Jansen, Bart M. P. ; de Kroon, Jari J. H. - p. 173-186 , 2022

Link: https://doi.org/10.1007/..

5

Vertex deletion parameterized by elimination distance and e..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Jansen, Bart M. P. ; de Kroon, Jari J. H. ; Włodarczyk, Michał - p. 1757-1769 , 2021

Link: https://dl.acm.org/doi/1..

6

FPT Algorithms to Compute the Elimination Distance to Bipar..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Jansen, Bart M. P. ; de Kroon, Jari J. H. - p. 80-93 , 2021

Link: https://doi.org/10.1007/..

7

Single-Exponential FPT Algorithms for Enumerating Secluded ..:

Jansen, Bart M. P ; de Kroon, Jari J. H ; Włodarczyk, Michał
Is Part Of LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023). , 2023

Link: https://doi.org/10.4230/..

8

Single-Exponential FPT Algorithms for Enumerating Secluded ..:

Jansen, Bart M. P ; de Kroon, Jari J. H ; Włodarczyk, Michał
http://arxiv.org/abs/2309.11366. , 2023

Link: http://arxiv.org/abs/230..

9

5-Approximation for $\mathcal{H}$-Treewidth Essentially as ..:

Jansen, Bart M. P ; de Kroon, Jari J. H ; Wlodarczyk, Michal
http://arxiv.org/abs/2306.17065. , 2023

Link: http://arxiv.org/abs/230..

10

Finding $k$-Secluded Trees Faster:

Donkers, Huib ; Jansen, Bart M. P ; de Kroon, Jari J. H
http://arxiv.org/abs/2206.09884. , 2022

Link: http://arxiv.org/abs/220..

11

Search-Space Reduction via Essential Vertices:

Bumpus, Benjamin Merlin ; Jansen, Bart M. P ; de Kroon, Jari J. H
doi:10.4230/LIPIcs.ESA.2022.30. , 2022

Link: https://doi.org/10.4230/..

12

Search-Space Reduction via Essential Vertices:

Bumpus, Benjamin Merlin ; Jansen, Bart M. P ; de Kroon, Jari J. H
http://arxiv.org/abs/2207.00386. , 2022

Link: http://arxiv.org/abs/220..

13

Vertex Deletion Parameterized by Elimination Distance and E..:

Jansen, Bart M. P ; de Kroon, Jari J. H ; Włodarczyk, Michał
http://arxiv.org/abs/2103.09715. , 2021

Link: http://arxiv.org/abs/210..

14

FPT Algorithms to Compute the Elimination Distance to Bipar..:

Jansen, Bart M. P ; de Kroon, Jari J. H
http://arxiv.org/abs/2106.04191. , 2021

Link: http://arxiv.org/abs/210..

15

Deletion to Scattered Graph Classes I -- case of finite num..:

Jacob, Ashwin ; de Kroon, Jari J. H ; Majumdar, Diptapriyo.
http://arxiv.org/abs/2105.04660. , 2021

Link: http://arxiv.org/abs/210..