22 citations · 73 across the 32 of their papers we have counts for
3 papers · 1 filter
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting
Palash Dey, Neeldhara Misra, Y. Narahari
In the Possible Winner problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made…
Vertex Cover Gets Faster and Harder on Low Degree Graphs
Akanksha Agrawal, Sathish Govindarajan, Neeldhara Misra
The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set pr…
Detecting Possible Manipulators in Elections
Palash Dey, Neeldhara Misra, Y. Narahari
Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection…