80 citations · 177 across the 40 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014★ 10 cited
The Online Disjoint Set Cover Problem and its Applications
Ashwin Pananjady, Vivek Kumar Bagaria, Rahul Vaze
Given a universe of elements and a collection of subsets of , the maximum disjoint set cover problem (DSCP) is to partition into as many set…
cs.DS2014
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion
Sounaka Mishra, Ashwin Pananjady, N Safina Devi
In this paper, we investigate the approximability of two node deletion problems. Given a vertex weighted graph and a specified, or "distinguished" vertex , MDD(m…