Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
van Leeuwen, Erik Jan
905  Ergebnisse:
englisch X
Personensuche X
?
1

Complexity Framework for Forbidden Subgraphs IV: The Steine..:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Bodlaender, Hans L. ; Johnson, Matthew ; Martin, Barnaby... - p. 206-217 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Parameterized Complexity of Streaming Diameter and Connecti..:

Oostveen, Jelle J. ; van Leeuwen, Erik Jan
Algorithmica.  , 2024
Link: https://doi.org/10.1007/..
 
?
3

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Theoretical Computer Science.  939 (2023)  - p. 182-193 , 2023
Link: https://doi.org/10.1016/..
 
?
4

Streaming deletion problems parameterized by vertex cover:

Oostveen, Jelle J. ; van Leeuwen, Erik Jan
Theoretical Computer Science.  979 (2023)  - p. 114178 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Induced Disjoint Paths and Connected Subgraphs for H-Free G..:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Algorithmica.  85 (2023)  9 - p. 2580-2604 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Induced Disjoint Paths in AT-free graphs:

Golovach, Petr A. ; Paulusma, Daniël ; van Leeuwen, Erik Jan
Journal of Computer and System Sciences.  124 (2022)  - p. 170-191 , 2022
Link: https://doi.org/10.1016/..
 
?
7

Disjoint paths and connected subgraphs for H-free graphs:

Kern, Walter ; Martin, Barnaby ; Paulusma, Daniël..
Theoretical Computer Science.  898 (2022)  - p. 59-68 , 2022
Link: https://doi.org/10.1016/..
 
?
8

Upper bounding rainbow connection number by forest number:

Sunil Chandran, L. ; Issac, Davis ; Lauri, Juho.
Discrete Mathematics.  345 (2022)  7 - p. 112829 , 2022
Link: https://doi.org/10.1016/..
 
?
9

Steiner trees for hereditary graph classes: A treewidth per..:

Bodlaender, Hans L. ; Brettell, Nick ; Johnson, Matthew...
Theoretical Computer Science.  867 (2021)  - p. 30-39 , 2021
Link: https://doi.org/10.1016/..
 
?
10

A Deterministic Polynomial Kernel for Odd Cycle Transversal..:

Jansen, Bart M. P. ; Pilipczuk, Marcin L. ; van Leeuwen, Erik Jan
SIAM Journal on Discrete Mathematics.  35 (2021)  4 - p. 2387-2429 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Ocean Surface Connectivity in the Arctic: Capabilities and ..:

Reijnders, Daan ; van Leeuwen, Erik Jan ; van Sebille, Erik
Journal of Geophysical Research: Oceans.  126 (2021)  1 - p. , 2021
Link: https://doi.org/10.1029/..
 
?
12

Algorithms for the rainbow vertex coloring problem on graph..:

Lima, Paloma T. ; van Leeuwen, Erik Jan ; van der Wegen, Marieke
Theoretical Computer Science.  887 (2021)  - p. 122-142 , 2021
Link: https://doi.org/10.1016/..
 
?
13

Nearly ETH-tight Algorithms for Planar Steiner Tree with Te..:

Kisfaludi-Bak, Sándor ; Nederlof, Jesper ; Leeuwen, Erik Jan van
ACM Transactions on Algorithms.  16 (2020)  3 - p. 1-30 , 2020
Link: https://doi.org/10.1145/..
 
?
14

Treewidth, Kernels, and Algorithms: Essays Dedicated to Han.. 

Theoretical Computer Science and General Issues, 12160
Fomin, Fedor V ; Kratsch, Stefan ; van Leeuwen, Erik Jan - 1st ed. 2020 . , 2020
Link: https://doi.org/10.1007/..
 
?
15

Solving Partition Problems Almost Always Requires Pushing M..:

Kanj, Iyad ; Komusiewicz, Christian ; Sorge, Manuel.
SIAM Journal on Discrete Mathematics.  34 (2020)  1 - p. 640-681 , 2020
Link: https://doi.org/10.1137/..
 
1-15