13 citations · 40 across the 13 of their papers we have counts for
3 papers · 2 filters
Fixed-Parameter and Approximation Algorithms: A New Look
Rajesh Chitnis, MohammadTaghi Hajiaghayi, Guy Kortsarz
A Fixed-Parameter Tractable (\FPT) -approximation algorithm for a minimization (resp. maximization) parameterized problem is an FPT algorithm that, given an instance $(x, k)…
List H-Coloring a Graph by Removing Few Vertices
Rajesh Chitnis, Laszlo Egri, Daniel Marx
In the deletion version of the list homomorphism problem, we are given graphs G and H, a list L(v) that is a subset of V(H) for each vertex v of G, and an integer k. The task is to…
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs
Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach
Bhawalkar, Kleinberg, Lewi, Roughgarden, and Sharma [ICALP 2012] introduced the Anchored k-Core problem, where the task is for a given graph G and integers b, k, and p to find an i…