Author

Author

Sort by: Order: Results:

  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Cornell University Library, 2019-05)
    We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and ...
  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (2019-08-10)
  • Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Elsevier, 2021-06)
    We study the parameterized complexity of the Optimal Defense and Optimal Attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a district consisting of a set of votes) ...

Search Digital Repository

Browse

My Account