Jelle J. Oostveen

According to our database, Jelle J. Oostveen authored at least 12 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Complexity Framework for Forbidden Subgraphs I: The Framework.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

Algorithmica, March, 2025

Computing subset vertex covers in H-free graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen

Theor. Comput. Sci., 2025

The Complexity of Diameter on \({H}\)-Free Graphs.

Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen

SIAM J. Discret. Math., 2025

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem.

Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

J. Comput. Syst. Sci., 2025

2024

Parameterized Complexity of Streaming Diameter and Connectivity Problems.

Jelle J. Oostveen, Erik Jan van Leeuwen

Algorithmica, September, 2024

2023

Streaming deletion problems parameterized by vertex cover.

Jelle J. Oostveen, Erik Jan van Leeuwen

Theor. Comput. Sci., November, 2023

The Parameterised Complexity Of Integer Multicommodity Flow.

Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Computing Subset Vertex Covers in H-Free Graphs.

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Complexity Framework For Forbidden Subgraphs.

Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen

CoRR, 2022

On Streaming Algorithms for Geometric Independent Set and Clique.

Sujoy Bhore, Fabian Klute, Jelle J. Oostveen

Proceedings of the Approximation and Online Algorithms - 20th International Workshop, 2022

2019

Having Fun in Learning Formal Specifications.

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

CoRR, 2019

Having fun in learning formal specifications.

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

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