20 citations · 81 across the 30 of their papers we have counts for
8 papers · 1 filter
Manipulating Node Similarity Measures in Networks
Palash Dey, Sourav Medya
Node similarity measures quantify how similar a pair of nodes are in a network. These similarity measures turn out to be an important fundamental tool for many real world applicati…
Minimizing Margin of Victory for Fair Political and Educational Districting
Ana-Andreea Stoica, Abhijnan Chakraborty, Palash Dey +1
In many practical scenarios, a population is divided into disjoint groups for better administration, e.g., electorates into political districts, employees into departments, student…
Gerrymandering: A Briber's Perspective
Palash Dey
We initiate the study of bribery problem in the context of gerrymandering and reverse gerrymandering. In our most general problem, the input is a set of voters having votes over a…
Distance Restricted Manipulation in Voting
Aditya Anand, Palash Dey
We introduce the notion of {\em Distance Restricted Manipulation}, where colluding manipulator(s) need to compute if there exist votes which make their preferred alternative win th…
A Parameterized Perspective on Protecting Elections
Palash Dey, Neeldhara Misra, Swaprava Nath +1
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…
Covert Networks: How Hard is It to Hide?
Palash Dey, Sourav Medya
Covert networks are social networks that often consist of harmful users. Social Network Analysis (SNA) has played an important role in reducing criminal activities (e.g., counter t…