Sushmita Gupta

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 53

Top Topics

Stable Marriage

Top Venues

Theor. Comput. Sci.

Publications

Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
When far is better: The Chamberlin-Courant approach to obnoxious committee selection. CoRR (2024)
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
Budget-feasible Egalitarian Allocation of Conflicting Jobs. CoRR (2024)
Sushmita Gupta, Ramanujan Sridharan, Peter Strulo
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. AAAI (2024)
Sushmita Gupta, M. S. Ramanujan, Peter Strulo
An Exercise in Tournament Design: When Some Matches Must Be Scheduled. CoRR (2024)
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
Conflict and Fairness in Resource Allocation. CoRR (2024)
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. CoRR (2024)
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. LATIN (1) (2024)
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
Budget-feasible Egalitarian Allocation of Conflicting Jobs. AAMAS (2024)
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
More Effort Towards Multiagent Knapsack. SOFSEM (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. CoRR (2023)
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. Algorithmica 85 (12) (2023)
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
Gehrlein Stable Committee with Multi-modal Preferences. SAGT (2022)
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). SIAM J. Discret. Math. 36 (1) (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Resolute control: Forbidding candidates from winning an election is hard. Theor. Comput. Sci. 915 (2022)
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
More Effort Towards Multiagent Knapsack. CoRR (2022)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Analysis for the Group Activity Selection Problem on Graphs. ISAIM (2022)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on graphs: Computational complexity and parameterized algorithms. CoRR (2021)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13 (2) (2021)
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT (2021)
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI (2021)
Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh
Parameterized Complexity of d-Hitting Set with Quotas. SOFSEM (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced stable marriage: How close is close enough? Theor. Comput. Sci. 883 (2021)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Quadratic Vertex Kernel for Rainbow Matching. Algorithmica 82 (4) (2020)
Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy
Algorithms for Swap and Shift Bribery in Structured Elections. AAMAS (2020)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic vertex kernel for split vertex deletion. Theor. Comput. Sci. 833 (2020)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. Bull. EATCS 130 (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. FSTTCS (2020)
Sushmita Gupta, Pallavi Jain, Saket Saurabh
Well-Structured Committees. IJCAI (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34 (1) (2020)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
On the (Parameterized) Complexity of Almost Stable Marriage. CoRR (2020)
Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Stability in barter exchange markets. Auton. Agents Multi Agent Syst. 33 (5) (2019)
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
Quadratic Vertex Kernel for Split Vertex Deletion. CIAC (2019)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica 81 (4) (2019)
Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi
On Succinct Encodings for the Tournament Fixing Problem. IJCAI (2019)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. SODA (2019)
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms. AAMAS (2019)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced Stable Marriage: How Close Is Close Enough? WADS (2019)
Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Stability in Barter Exchange Markets. AAMAS (2018)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Winning a Tournament by Any Means Necessary. IJCAI (2018)
Sushmita Gupta, Sanjukta Roy
Stable Matching Games: Manipulation via Subgraph Isomorphism. Algorithmica 80 (9) (2018)
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Popular Matching in Roommates Setting is NP-hard. CoRR (2018)
Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized algorithms for stable matching with ties and incomplete lists. Theor. Comput. Sci. 723 (2018)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
When Rigging a Tournament, Let Greediness Blind You. IJCAI (2018)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Balanced Stable Marriage: How Close is Close Enough? CoRR (2017)
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
On Treewidth and Stable Marriage. CoRR (2017)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Group Activity Selection on Graphs: Parameterized Analysis. SAGT (2017)
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
Parameterized Algorithms and Kernels for Rainbow Matching. MFCS (2017)
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
On the Advice Complexity of the k-server Problem Under Sparse Metrics. Theory Comput. Syst. 59 (3) (2016)
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
Total Stability in Stable Matching Games. SWAT (2016)
Sushmita Gupta, Sanjukta Roy
Stable Matching Games: Manipulation via Subgraph Isomorphism. FSTTCS (2016)
Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC (2016)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative interval analysis of paging algorithms on access graphs. Theor. Comput. Sci. 568 (2015)
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
Stable Nash Equilibria in the Gale-Shapley Matching Game. CoRR (2015)
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
On Advice Complexity of the k-server Problem under Sparse Metrics. SIROCCO (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs. WADS (2013)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Relative Interval Analysis of Paging Algorithms on Access Graphs CoRR (2013)
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
On Advice Complexity of the k-server Problem under Sparse Metrics CoRR (2013)
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. SIAM J. Discret. Math. 26 (4) (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis CoRR (2012)
Joan Boyar, Sushmita Gupta, Kim S. Larsen
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. SWAT (2012)
Sushmita Gupta
Feedback arc set problem in bipartite tournaments. Inf. Process. Lett. 105 (4) (2008)
Sushmita Gupta
Feedback Arc Set Problem in Bipartite Tournaments. TAMC (2007)
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
-Regular Induced Subgraph Problems. FSTTCS (2006)