E-LIB Suche - Ergebnisse für: Oostveen, Jelle J.

1

Parameterized Complexity of Streaming Diameter and Connecti..:

Oostveen, Jelle J. ; van Leeuwen, Erik Jan
Algorithmica. , 2024

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

2

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/..

3

Computing Subset Vertex Covers in H-Free Graphs:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Brettell, Nick ; Oostveen, Jelle J. ; Pandey, Sukanya.. - p. 88-102 , 2023

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

4

On Streaming Algorithms for Geometric Independent Set and C..:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,

Bhore, Sujoy ; Klute, Fabian ; Oostveen, Jelle J. - p. 211-224 , 2022

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

5

Streaming Deletion Problems Parameterized by Vertex Cover:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,

Oostveen, Jelle J. ; van Leeuwen, Erik Jan - p. 413-426 , 2021

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

6

Having fun in learning formal specifications:

, In: Proceedings of the 41st International Conference on Software Engineering: Software Engineering Education and Training,

Prasetya, I. S. W. B. ; Leek, Craig Q. H. D. ; Melkonian, Orestis... - p. 192-196 , 2019

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

7

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..

8

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..

9

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..

10

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..

11

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..

12

The Parameterised Complexity Of Integer Multicommodity Flow:

Bodlaender, Hans L ; Mannens, Isja ; Oostveen, Jelle J..
Is Part Of LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). , 2023

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

13

Streaming deletion problems parameterized by vertex cover:

Oostveen, Jelle ; van Leeuwen, Erik Jan
https://dspace.library.uu.nl/handle/1874/431820. , 2023

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

14

On Streaming Algorithms for Geometric Independent Set and C..:

Bhore, Sujoy ; Klute, Fabian ; Oostveen, Jelle J
http://arxiv.org/abs/2207.01108. , 2022

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

15

Parameterized Complexity of Streaming Diameter and Connecti..:

Oostveen, Jelle J ; Leeuwen, Erik Jan van ; Dell, Holger.
1868-8969. , 2022

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