3 papers
cs.DS2016
The Non-Uniform k-Center Problem
Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy
In this paper, we introduce and study the Non-Uniform k-Center problem (NUkC). Given a finite metric space and a collection of balls of radii ,…
cs.DS2014
Finding Even Subgraphs Even Faster
Prachi Goyal, Pranabendu Misra, Fahad Panolan +2
Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on vertices and a positive i…
cs.DS2013
On the Parameterized Complexity of the Maximum Edge Coloring Problem
Prachi Goyal, Vikram Kamat, Neeldhara Misra
We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q>1 and a gra…