Saurabh Saket

Saket Saurabh

Information about the author Saket Saurabh will soon be added to the site.
Found 6 papers in total
Quick but Odd Growth of Cacti
Quick but Odd Growth of Cacti
2017
Let F be a family of graphs. Given an n ‐vertex input graph G and a positive...
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...
Computing Optimal Steiner Trees in Polynomial Space
Computing Optimal Steiner Trees in Polynomial Space
2013
Given an n ‐node edge‐weighted graph and a subset of k terminal nodes,...
Sharp Separation and Applications to Exact and Parameterized Algorithms
Sharp Separation and Applications to Exact and Parameterized Algorithms
2012
Many divide‐and‐conquer algorithms employ the fact that the vertex set...
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...
Papers per page: