Author

Author

Sort by: Order: Results:

  • 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