E-LIB Suche - Ergebnisse für: van Leeuwen, Erik Jan

1

The Parameterised Complexity of Integer Multicommodity Flow:

Bodlaender, Hans L ; Mannens, Isja ; Oostveen, Jelle J..
http://arxiv.org/abs/2310.05784. , 2023

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

2

Space-Efficient Parameterized Algorithms on Graphs of Low S..:

Bergougnoux, Benjamin ; Chekan, Vera ; Ganian, Robert...
http://arxiv.org/abs/2307.01285. , 2023

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

3

Complexity Framework for Forbidden Subgraphs {III:}: When P..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
https://dspace.library.uu.nl/handle/1874/431613. , 2023

Link: https://dspace.library.u..

4

Computing Subset Vertex Covers in H-Free Graphs:

Brettell, Nick ; Oostveen, Jelle ; Pandey, Sukanya..
https://dspace.library.uu.nl/handle/1874/431577. , 2023

Link: https://dspace.library.u..

5

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
0304-3975. , 2023

Link: https://dspace.library.u..

6

Space-Efficient Parameterized Algorithms on Graphs of Low S..:

Bergougnoux, Benjamin ; Chekan, Vera ; Ganian, Robert...
1868-8969. , 2023

Link: https://dspace.library.u..

7

Complexity Framework for Forbidden Subgraphs III: When Prob..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
http://arxiv.org/abs/2305.01104. , 2023

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

8

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

Bodlaender, Hans L ; Johnson, Matthew ; Martin, Barnaby...
http://arxiv.org/abs/2305.01613. , 2023

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

9

Separator Theorem and Algorithms for Planar Hyperbolic Grap..:

Kisfaludi-Bak, Sándor ; Masaříková, Jana ; van Leeuwen, Erik Jan..
http://arxiv.org/abs/2310.11283. , 2023

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

10

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

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Martin , B , Paulusma , D , Smith , S & van Leeuwen , E J 2023 , ' Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs ' , Algorithmica , vol. 85 , no. 9 , pp. 2580-2604 . https://doi.org/10.1007/s00453-023-01109-z. , 2023

Link: https://hdl.handle.net/1..

11

Computing Subset Vertex Covers in $H$-Free Graphs:

Brettell, Nick ; Oostveen, Jelle J ; Pandey, Sukanya..
http://arxiv.org/abs/2307.05701. , 2023

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

12

Complexity Framework for Forbidden Subgraphs {III:}: When P..:

Johnson, Matthew ; Martin, Barnaby ; Pandey, Sukanya...
1868-8969. , 2023

Link: https://dspace.library.u..

13

Few induced disjoint paths for H-free graphs:

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
Martin , B , Paulusma , D , Smith , S & van Leeuwen , E J 2023 , ' Few induced disjoint paths for H-free graphs ' , Theoretical Computer Science , vol. 939 , pp. 182-193 . https://doi.org/10.1016/j.tcs.2022.10.024. , 2023

Link: https://hdl.handle.net/1..

14

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

Martin, Barnaby ; Paulusma, Daniël ; Smith, Siani.
dro:38332. , 2023

Link: http://dro.dur.ac.uk/383..

15

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

Bodlaender, Hans L ; Johnson, Matthew ; Martin, Barnaby...
https://dspace.library.uu.nl/handle/1874/431612. , 2023

Link: https://dspace.library.u..