J. Oostveen

activity

20192024

most citedHaving Fun in Learning Formal Specifications

3 citations · 6 across the 8 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2023

Computing Subset Vertex Covers in $H$ -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 $G = (V, E)$ , a subset $T \subseteq V$ and integer $k$ , if $V$ has…

math.CO2023★ 2 cited

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

Hans L. Bodlaender, Matthew Johnson, Barnaby Martin +5

We study Steiner Forest on $H$ -subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent…

math.CO2022★ 1 cited

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…

Computing Subset Vertex Covers in H-Free Graphs

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

Complexity Framework For Forbidden Subgraphs I: The Framework

Computing Subset Vertex Covers in $H$ -Free Graphs