J. Oostveen

collaborators

2 papers

cs.DS2025

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…

math.CO2025

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…

The Complexity of Diameter on H-free graphs

Computing Subset Vertex Covers in H-Free Graphs

Computing Subset Vertex Covers in $H$ -Free Graphs