2 citations · 10 across the 19 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Complexity of Eliminating (Majority) Illusion in Directed Networks
Sougata Jana, Sanjukta Roy
We study illusion elimination problems on directed social networks where each vertex is colored either red or blue. A vertex is under \textit{majority illusion} if it has more red…
cs.DS2021
Gerrymandering on graphs: Computational complexity and parameterized algorithms
Sushmita Gupta, Pallavi Jain, Fahad Panolan +2
Partitioning a region into districts to favor a particular candidate or a party is commonly known as gerrymandering. In this paper, we investigate the gerrymandering problem in gra…
cs.DS2017
Balanced Stable Marriage: How Close is Close Enough?
Sushmita Gupta, Sanjukta Roy, Saket Saurabh +1
The Balanced Stable Marriage problem is a central optimization version of the classic Stable Marriage problem. Here, the output cannot be an arbitrary stable matching, but one that…