3 papers
cs.DS2022
Improved Bi-point Rounding Algorithms and a Golden Barrier for -Median
Kishen N. Gowda, Thomas Pensyl, Aravind Srinivasan +1
The current best approximation algorithms for -median rely on first obtaining a structured fractional solution known as a bi-point solution, and then rounding it to an integer s…
cs.DS2020
Improved FPT Algorithms for Deletion to Forest-like Structures
Kishen N. Gowda, Aditya Lonkar, Fahad Panolan +2
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterized Complexity. In this problem, given an undirected graph and a non-negative…
cs.GT2020
A Parameterized Perspective on Attacking and Defending Elections
Kishen N. Gowda, Neeldhara Misra, Vraj Patel
We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multi…