In the Feedback Vertex Set problem, we aim to find a small set S of
vert...
We prove new complexity results for Feedback Vertex Set and Even Cycle
T...
We study the computational complexity of two well-known graph transversa...
We consider the classical problems (Edge) Steiner Tree and Vertex Steine...
A large number of NP-hard graph problems become polynomial-time solvable...
Let vc(G), fvs(G) and oct(G), respectively, denote the size of a
minimum...
A graph is H-free if it contains no induced subgraph isomorphic to H. We...
The Connected Vertex Cover problem is to decide if a graph G has a verte...