research
∙
07/11/2023
Computing Subset Vertex Covers in H-Free Graphs
We consider a natural generalization of Vertex Cover: the Subset Vertex ...
share
research
∙
05/02/2023
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
research
∙
11/23/2022
Complexity Framework For Forbidden Subgraphs
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is ℋ-subgraph-free...
research
∙
07/11/2022
Parameterized Complexity of Streaming Diameter and Connectivity Problems
We initiate the investigation of the parameterized complexity of Diamete...
research
∙
07/03/2022
On Streaming Algorithms for Geometric Independent Set and Clique
We study the maximum geometric independent set and clique problems in th...
research
∙
11/19/2021
Streaming Deletion Problems Parameterized by Vertex Cover
Streaming is a model where an input graph is provided one edge at a time...
research
∙
03/01/2019
