22 citations · 73 across the 32 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2013★ 10 cited
Upper and Lower Bounds for Weak Backdoor Set Detection
Neeldhara Misra, Sebastian Ordyniak, Venkatesh Raman +1
We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These…