3 citations · 6 across the 8 of their papers we have counts for
9 papers
The Complexity of Diameter on H-free graphs
Jelle J. Oostveen, Daniël Paulusma, Erik Jan van Leeuwen
The intensively studied Diameter problem is to find the diameter of a given connected graph. We investigate, for the first time in a structured manner, the complexity of Diameter f…
The Parameterised Complexity of Integer Multicommodity Flow
Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen +2
The Integer Multicommodity Flow problem has been studied extensively in the literature. However, from a parameterised perspective, mostly special cases, such as the Disjoint Paths…
Computing Subset Vertex Covers in -Free Graphs
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey +3
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph , a subset and integer , if has…
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
Hans L. Bodlaender, Matthew Johnson, Barnaby Martin +5
We study Steiner Forest on -subgraph-free graphs, that is, graphs that do not contain some fixed graph as a (not necessarily induced) subgraph. We are motivated by a recent…
Complexity Framework For Forbidden Subgraphs I: The Framework
Matthew Johnson, Barnaby Martin, Jelle J. Oostveen +4
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. T…
On Streaming Algorithms for Geometric Independent Set and Clique
Sujoy Bhore, Fabian Klute, Jelle J. Oostveen
We study the maximum geometric independent set and clique problems in the streaming model. Given a collection of geometric objects arriving in an insertion only stream, the aim is…
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Jelle J. Oostveen, Erik Jan van Leeuwen
We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of si…
Streaming Deletion Problems Parameterized by Vertex Cover
Jelle J. Oostveen, Erik Jan van Leeuwen
Streaming is a model where an input graph is provided one edge at a time, instead of being able to inspect it at will. In this work, we take a parameterized approach by assuming a…
Having Fun in Learning Formal Specifications
I. S. W. B. Prasetya, Craig Q. H. D. Leek, Orestis Melkonian +11
There are many benefits in providing formal specifications for our software. However, teaching students to do this is not always easy as courses on formal methods are often experie…