375 citations · 494 across the 29 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Frameworks for Designing In-place Graph Algorithms
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman +1
Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm…
cs.DS2017★ 16 cited
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
R. Krithika, Diptapriyo Majumdar, Venkatesh Raman
The CONNECTED VERTEX COVER problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely…