29 citations · 53 across the 16 of their papers we have counts for
22 papers
Addressing Bias in Algorithmic Solutions: Exploring Vertex Cover and Feedback Vertex Set
Sheikh Shakil Akhtar, Jayakrishnan Madathil, Pranabendu Misra +1
A typical goal of research in combinatorial optimization is to come up with fast algorithms that find optimal solutions to a computational problem. The process that takes a real-wo…
-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Fredrik Manne, Geevarghese Philip, Saket Saurabh +1
Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms in preserving approxim…
Diverse Collections in Matroids and Graphs
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan +2
We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from gra…
Disjoint Stable Matchings in Linear Time
Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar +1
We show that given a SM instance G as input we can find a largest collection of pairwise edge-disjoint stable matchings of G in time linear in the input size. This extends two clas…
Diverse Pairs of Matchings
Fedor V. Fomin, Petr A. Golovach, Lars Jaffke +2
We initiate the study of the Diverse Pair of (Maximum/ Perfect) Matchings problems which given a graph and an integer , ask whether has two (maximum/perfect) matchings w…
Structural Parameterizations of Clique Coloring
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the C…