7 citations · 9 across the 2 of their papers we have counts for
4 papers · 1 filter
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…
Popular Matching in Roommates Setting is NP-hard
Sushmita Gupta, Pranabendu Misra, Saket Saurabh +1
An input to the Popular Matching problem, in the roommates setting, consists of a graph and each vertex ranks its neighbors in strict order, known as its preference. In the Pop…
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…
On Treewidth and Stable Marriage
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SE…