research
∙
07/03/2022
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
For many problems, the important instances from practice possess certain...
share
research
∙
02/24/2022
Polynomial Kernels for Tracking Shortest Paths
Given an undirected graph G=(V,E), vertices s,t∈ V, and an integer k, Tr...
research
∙
10/13/2021
Parameterized Complexity of Minimum Membership Dominating Set
Given a graph G=(V,E) and an integer k, the Minimum Membership Dominatin...
research
∙
08/03/2021
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
Consider a vertex-weighted graph G with a source s and a target t. Track...
research
∙
07/26/2021
On Kernels for d-Path Vertex Cover
In this paper we study the kernelization of d-Path Vertex Cover (d-PVC) ...
research
∙
08/22/2020
Structural Parameterizations of Tracking Paths Problem
Given a graph G with source and destination vertices s,t∈ V(G) respectiv...
research
∙
02/18/2020
Polynomial Time Algorithms for Tracking Path Problems
Given a graph G, and terminal vertices s and t, the TRACKING PATHS probl...
research
∙
01/24/2020
Fixed-parameter tractable algorithms for Tracking Shortest Paths
We consider the parameterized complexity of the problem of tracking shor...
research
∙
01/09/2020