1 citations · 1 across the 3 of their papers we have counts for
5 papers
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
For numerous graph problems in the realm of parameterized algorithms, using the size of a smallest deletion set (called a modulator) into well-understood graph families as paramete…
Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
Christian Komusiewicz, Diptapriyo Majumdar
Enumeration kernelization was first proposed by Creignou et al. [TOCS 2017] and was later refined by Golovach et al. [JCSS 2022] into two different variants: fully-polynomial enume…
Fixed-Parameter Algorithms for Fair Hitting Set Problems
Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu +2
Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic algorithmic study of…
Parameterized algorithms for Eccentricity Shortest Path Problem
Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh +2
Given an undirected graph and an integer , the Eccentricity Shortest Path (ESP) asks to find a shortest path such that for every vertex , there is a…
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov +4
For a graph class , the graph parameters elimination distance to (denoted by ) [Bulian and Dawar, Algorithmica, 2016], and -treewi…