Get started
Author

Jelle J. Oostveen

Observed names: J.J. Oostveen, Jelle Joannes Oostveen, Jelle Oostveen, Oostveen, Jelle, Oostveen, Jelle J.
Institution: Utrecht University
Observed institution: Utrecht University
ORCID: 0009-0009-4419-3143
Observed ORCID: 0009-0009-4419-3143
OpenAlex ID: A5048388564
Having Fun in Learning Formal Specifications
2019 · Wishnu Prasetya, Craig Leek, et al. · IEEE/ACM International Conference on Software Engineering: Software Engineering Education and Training (ICSE-SEET) · 22
PDF
Complexity Framework for Forbidden Subgraphs I: The Framework
2025 · Matthew Johnson, Barnaby Martin, et al. · Algorithmica · 3
PDF
Problems hard for treewidth but easy for stable gonality
2022 · Bodlaender, Hans L., Mannens, Isja, et al. · arXiv (Cornell University) · 3
PDF
Having Fun in Learning Formal Specifications
2019 · Prasetya, I. S. W. B., Leek, Craig Q. H. D., et al. · arXiv (Cornell University) · 3
PDF
Computing subset vertex covers in H-free graphs
2025 · Nick Brettell, Jelle J. Oostveen, et al. · Theoretical Computer Science · 2
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
2024 · Hans L. Bodlaender, Matthew Johnson, et al. · Lecture notes in computer science · 2
PDF
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
2023 · Bodlaender, Hans L., Johnson, Matthew, et al. · arXiv (Cornell University) · 2
PDF
The Complexity of Diameter on H-free Graphs
2025 · Jelle J. Oostveen, Daniël Paulusma, et al. · Lecture notes in computer science · 1
PDF
Parameterized Complexity of Streaming Diameter and Connectivity Problems
2024 · Jelle J. Oostveen, Erik Jan van Leeuwen · Algorithmica · 1
The Parameterised Complexity of Integer Multicommodity Flow
2023 · Bodlaender, Hans L., Mannens, Isja, et al. · arXiv (Cornell University) · 1
PDF
Complexity Framework For Forbidden Subgraphs I: The Framework
2022 · Johnson, Matthew, Martin, Barnaby, et al. · arXiv (Cornell University) · 1
PDF
On Streaming Algorithms for Geometric Independent Set and Clique
2022 · Sujoy Bhore, Fabian Klute, et al. · Lecture notes in computer science · 1
Streaming Deletion Problems Parameterized by Vertex Cover
2021 · Jelle J. Oostveen, Erik Jan van Leeuwen · Lecture notes in computer science · 1
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 · Hans L. Bodlaender, Matthew Johnson, et al. · Journal of Computer and System Sciences
A Diametral Path through Streams and Forbidden Patterns
2025 · Jelle Joannes Oostveen
The Complexity of Diameter on \({H}\)-Free Graphs
2025 · Jelle J. Oostveen, Daniël Paulusma, et al. · SIAM Journal on Discrete Mathematics
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem
2025 · Bodlaender, Hans L., Johnson, Matthew, et al. · Journal of Computer and System Sciences
The Complexity of Diameter on H-free graphs
2024 · Oostveen, Jelle J., Paulusma, Daniël, et al. · arXiv (Cornell University)
PDF
Streaming deletion problems parameterized by vertex cover
2023 · Jelle J. Oostveen, Erik Jan van Leeuwen · Theoretical Computer Science
Computing Subset Vertex Covers in $H$-Free Graphs
2023 · Brettell, Nick, Oostveen, Jelle J., et al. · arXiv (Cornell University)
PDF
Computing Subset Vertex Covers in H-Free Graphs
2023 · Nick Brettell, Jelle J. Oostveen, et al. · Lecture notes in computer science
PDF
On Streaming Algorithms for Geometric Independent Set and Clique
2022 · Bhore, Sujoy, Klute, Fabian, et al. · arXiv (Cornell University)
PDF
Streaming Deletion Problems Parameterized by Vertex Cover
2021 · Oostveen, Jelle J., van Leeuwen, Erik Jan · arXiv (Cornell University)
PDF
Parameterized Algorithms in a Streaming Setting
2020 · Jelle J. Oostveen · Utrecht University Repository (Utrecht University)
PDF
Algoritmes voor Firefighting op bomen
2018 · J.J. Oostveen · Utrecht University Repository (Utrecht University)
Works count: 28
Citation count: 44
H-index: 3
I10-index: 1
Year
Topic
Type