We consider a natural generalization of Vertex Cover: the Subset Vertex ...
We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is
ℋ-subgraph-free...
We initiate the investigation of the parameterized complexity of Diamete...
We study the maximum geometric independent set and clique problems in th...
Streaming is a model where an input graph is provided one edge at a time...
There are many benefits in providing formal specifications for our softw...