
Parameterized Complexity of Minimum Membership Dominating Set
Given a graph G=(V,E) and an integer k, the Minimum Membership Dominatin...
read it

Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
Consider a vertexweighted graph G with a source s and a target t. Track...
read it

On Kernels for dPath Vertex Cover
In this paper we study the kernelization of dPath Vertex Cover (dPVC) ...
read it

Structural Parameterizations of Tracking Paths Problem
Given a graph G with source and destination vertices s,t∈ V(G) respectiv...
read it

Polynomial Time Algorithms for Tracking Path Problems
Given a graph G, and terminal vertices s and t, the TRACKING PATHS probl...
read it

Fixedparameter tractable algorithms for Tracking Shortest Paths
We consider the parameterized complexity of the problem of tracking shor...
read it

Improved Kernels for Tracking Path Problems
Given a graph G, terminal vertices s and t, and an integer k, the Tracki...
read it
Pratibha Choudhary
is this you? claim profile