Raman Venkatesh

Venkatesh Raman

Information about the author Venkatesh Raman will soon be added to the site.
Found 4 papers in total
The Parameterized Complexity of Unique Coverage and Its Variants
The Parameterized Complexity of Unique Coverage and Its Variants
2013
In this paper we study the parameterized complexity of the Unique Coverage problem, a...
The Complexity of König Subgraph Problems and Above‐Guarantee Vertex Cover
The Complexity of König Subgraph Problems and Above‐Guarantee Vertex Cover
2011
A graph is König‐Egerváry if the size of a minimum vertex cover...
On the directed Full Degree Spanning Tree problem
On the directed Full Degree Spanning Tree problem
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning...
The complexity of irredundant sets parameterized by size
The complexity of irredundant sets parameterized by size
2000
An irredundant set of vertices V′⊆V in a graph G=(V,E) has the property...
Papers per page: