Jelle J. Oostveen

23 papers B 6C 1Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Complexity Framework for Forbidden Subgraphs I: The Framework.
Algorithmica
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025 J jnl
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem.
J. Comput. Syst. Sci.
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025 J jnl
Computing subset vertex covers in H-free graphs.
Theor. Comput. Sci.
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025 J jnl
The Complexity of Diameter on \({H}\)-Free Graphs.
SIAM J. Discret. Math.
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2024 C conf
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
IWOCA
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024 J jnl
Parameterized Complexity of Streaming Diameter and Connectivity Problems.
Algorithmica
Jelle J. Oostveen, Erik Jan van Leeuwen
2024 B conf
The Complexity of Diameter on H-free Graphs.
WG
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2024 J jnl
The Complexity of Diameter on H-free graphs.
CoRR
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
2023 J jnl
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem.
CoRR
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023 B conf
Computing Subset Vertex Covers in H-Free Graphs.
FCT
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023 J jnl
Computing Subset Vertex Covers in H-Free Graphs.
CoRR
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2023 J jnl
Streaming deletion problems parameterized by vertex cover.
Theor. Comput. Sci.
Jelle J. Oostveen, Erik Jan van Leeuwen
2023 B conf
The Parameterised Complexity Of Integer Multicommodity Flow.
IPEC
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2023 J jnl
The Parameterised Complexity of Integer Multicommodity Flow.
CoRR
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen
2022 J jnl
Complexity Framework For Forbidden Subgraphs.
CoRR
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022 B conf
On Streaming Algorithms for Geometric Independent Set and Clique.
WAOA
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
2022 J jnl
On Streaming Algorithms for Geometric Independent Set and Clique.
CoRR
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
2022 B conf
Parameterized Complexity of Streaming Diameter and Connectivity Problems.
IPEC
Jelle J. Oostveen, Erik Jan van Leeuwen
2022 J jnl
Parameterized Complexity of Streaming Diameter and Connectivity Problems.
CoRR
Jelle J. Oostveen, Erik Jan van Leeuwen
2021 B conf
Streaming Deletion Problems Parameterized by Vertex Cover.
FCT
Jelle J. Oostveen, Erik Jan van Leeuwen
2021 J jnl
Streaming Deletion Problems Parameterized by Vertex Cover.
CoRR
Jelle J. Oostveen, Erik Jan van Leeuwen
2019 J jnl
Having Fun in Learning Formal Specifications.
CoRR
I. S. W. B. Prasetya, Craig Q. H. D. Leek, Orestis Melkonian, Joris ten Tusscher, Jan van Bergen, J. M. Everink, Thomas van der Klis, Petar Kostic, Rick Meijerink, Roan Oosenbrug, Jelle J. Oostveen, Tijmen van den Pol, Mike de Vries, Wink M. van Zon
2019 — conf
Having fun in learning formal specifications.
ICSE (SEET)
I. S. W. B. Prasetya, Craig Q. H. D. Leek, Orestis Melkonian, Joris ten Tusscher, Jan van Bergen, J. M. Everink, Thomas van der Klis, Rick Meijerink, Roan Oosenbrug, Jelle J. Oostveen, Tijmen van den Pol, Wink M. van Zon