375 citations · 494 across the 29 of their papers we have counts for
6 papers · 1 filter
Structural Parameterizations of Tracking Paths Problem
Pratibha Choudhary, Venkatesh Raman
Given a graph with source and destination vertices respectively, \textsc{Tracking Paths} asks for a minimum set of vertices , such that the seque…
Approximation in (Poly-) Logarithmic Space
Arindam Biswas, Venkatesh Raman, Saket Saurabh
We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitt…
Recognizing -Clique Extendible Orderings
Mathew Francis, Rian Neogi, Venkatesh Raman
A graph is -clique-extendible if there is an ordering of the vertices such that whenever two -sized overlapping cliques and have common vertices, and these comm…
Structural Parameterizations with Modulator Oblivion
Ashwin Jacob, Fahad Panolan, Venkatesh Raman +1
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems i…
Fixed-parameter tractable algorithms for Tracking Shortest Paths
Aritra Banik, Pratibha Choudhary, Venkatesh Raman +1
We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks. Given an undirected a…
Improved Kernels for Tracking Path Problem
Pratibha Choudhary, Venkatesh Raman
Tracking of moving objects is crucial to security systems and networks. Given a graph , terminal vertices and , and an integer , the \textsc{Tracking Paths} problem as…