Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems. - Sushmita Gupta; Venkatesh Raman 001; Saket Saurabh 001 (FSTTCS, 2006)

Feedback arc set problem in bipartite tournaments. - Sushmita Gupta (Inf. Process. Lett., 2008)

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (SWAT, 2012)

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds. - Sushmita Gupta; Venkatesh Raman 001; Saket Saurabh 001 (SIAM J. Discret. Math., 2012)

Stable Nash Equilibria in the Gale-Shapley Matching Game. - Sushmita Gupta; Kazuo Iwama; Shuichi Miyazaki (CoRR, 2015)

Relative interval analysis of paging algorithms on access graphs. - Joan Boyar; Sushmita Gupta; Kim S. Larsen (Theor. Comput. Sci., 2015)

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. - Akanksha Agrawal 001; Sushmita Gupta; Saket Saurabh 001; Roohani Sharma (IPEC, 2016)

Total Stability in Stable Matching Games. - Sushmita Gupta; Kazuo Iwama; Shuichi Miyazaki (SWAT, 2016)

On the Advice Complexity of the k-server Problem Under Sparse Metrics. - Sushmita Gupta; Shahin Kamali; Alejandro López-Ortiz (Theory Comput. Syst., 2016)

Group Activity Selection on Graphs: Parameterized Analysis. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (SAGT, 2017)

On Treewidth and Stable Marriage. - Sushmita Gupta; Saket Saurabh 001; Meirav Zehavi (CoRR, 2017)

When Rigging a Tournament, Let Greediness Blind You. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Winning a Tournament by Any Means Necessary. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (IJCAI, 2018)

Stable Matching Games: Manipulation via Subgraph Isomorphism. - Sushmita Gupta; Sanjukta Roy 001 (Algorithmica, 2018)

Parameterized algorithms for stable matching with ties and incomplete lists. - Deeksha Adil; Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2018)

On Succinct Encodings for the Tournament Fixing Problem. - Sushmita Gupta; Saket Saurabh 001; Ramanujan Sridharan; Meirav Zehavi (IJCAI, 2019)

Stability in barter exchange markets. - Sushmita Gupta; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2019)

Parameterized Algorithms and Kernels for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2019)

Algorithms for Swap and Shift Bribery in Structured Elections. - Edith Elkind; Piotr Faliszewski; Sushmita Gupta; Sanjukta Roy 001 (AAMAS, 2020)

On the (Parameterized) Complexity of Almost Stable Marriage. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (FSTTCS, 2020)

Well-Structured Committees. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001 (IJCAI, 2020)

Gehrlein stability in committee selection: parameterized hardness and algorithms. - Sushmita Gupta; Pallavi Jain 001; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Auton. Agents Multi Agent Syst., 2020)

Quadratic Vertex Kernel for Rainbow Matching. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Algorithmica, 2020)

Popular Matching in Roommates Setting is NP-hard. - Sushmita Gupta; Pranabendu Misra; Saket Saurabh 001; Meirav Zehavi (Bull. EATCS, 2020)

Quadratic vertex kernel for split vertex deletion. - Akanksha Agrawal 001; Sushmita Gupta; Pallavi Jain 001; R. Krithika 001 (Theor. Comput. Sci., 2020)

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. - Sushmita Gupta; Pallavi Jain 001; Fahad Panolan; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2021)

Parameterized Complexity of d-Hitting Set with Quotas. - Sushmita Gupta; Pallavi Jain 001; Aditya Petety; Sagar Singh (SOFSEM, 2021)

Balanced stable marriage: How close is close enough? - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2021)

Parameterized Analysis for the Group Activity Selection Problem on Graphs. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (ISAIM, 2022)

Gehrlein Stable Committee with Multi-modal Preferences. - Sushmita Gupta; Pallavi Jain 001; Daniel Lokshtanov; Sanjukta Roy 001; Saket Saurabh 001 (SAGT, 2022)

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). - Sushmita Gupta; Saket Saurabh 001; Meirav Zehavi (SIAM J. Discret. Math., 2022)

Resolute control: Forbidding candidates from winning an election is hard. - Sushmita Gupta; Sanjukta Roy 001; Saket Saurabh 001; Meirav Zehavi (Theor. Comput. Sci., 2022)

More Effort Towards Multiagent Knapsack. - Sushmita Gupta; Pallavi Jain 001; Sanjay Seetharaman (SOFSEM, 2023)

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001 (CoRR, 2023)

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. - Sushmita Gupta; Pallavi Jain 001; Saket Saurabh 001; Nimrod Talmon (Algorithmica, 2023)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled. - Sushmita Gupta; Ramanujan Sridharan; Peter Strulo (AAAI, 2024)

Manipulation With(out) Money in Matching Market. - Sushmita Gupta; Pallavi Jain 001 (ADT, 2024)

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection. - Sushmita Gupta; Tanmay Inamdar 002; Pallavi Jain 001; Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001 (FSTTCS, 2024)

On Controlling Knockout Tournaments Without Perfect Information. - Václav Blazej; Sushmita Gupta; M. S. Ramanujan 001; Peter Strulo (IPEC, 2024)

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments. - Sushmita Gupta; Sounak Modak; Saket Saurabh 001; Sanjay Seetharaman (LATIN (1), 2024)

Conflict and Fairness in Resource Allocation. - Susobhan Bandopadhyay; Aritra Banik; Sushmita Gupta; Pallavi Jain 001; Abhishek Sahu; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2024)

Parameterized Complexity of Disconnected Matchings. - Sushmita Gupta; Pallavi Jain 001; Lawqueen Kanesh; Sounak Modak; Saket Saurabh 001 (CIAC (2), 2025)

Tractable Graph Structures in EFX Orientation. - Václav Blazej; Sushmita Gupta; M. S. Ramanujan 001; Peter Strulo (SAGT, 2025)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules. - Sushmita Gupta; Pallavi Jain 001; Souvik Saha 002; Saket Saurabh 001; Anannya Upasana (CoRR, 2025)

Budget-feasible egalitarian allocation of conflicting jobs. - Sushmita Gupta; Pallavi Jain 001; A. Mohanapriya; Vikash Tripathi (Auton. Agents Multi Agent Syst., 2025)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma. - Sushmita Gupta; Pallavi Jain 001; Sanjay Seetharaman; Meirav Zehavi (CoRR, 2025)