Sushmita Gupta

According to our database, Sushmita Gupta authored at least 42 papers between 2006 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Budget-feasible egalitarian allocation of conflicting jobs.

Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi

Auton. Agents Multi Agent Syst., June, 2025

2024

Conflict and Fairness in Resource Allocation.

Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale

CoRR, 2024

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.

Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

On Controlling Knockout Tournaments Without Perfect Information.

Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.

Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Manipulation With(out) Money in Matching Market.

Sushmita Gupta, Pallavi Jain

Proceedings of the Algorithmic Decision Theory - 8th International Conference, 2024

An Exercise in Tournament Design: When Some Matches Must Be Scheduled.

Sushmita Gupta, Ramanujan Sridharan, Peter Strulo

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.

Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon

Algorithmica, December, 2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.

Sushmita Gupta, Pallavi Jain, Saket Saurabh

CoRR, 2023

More Effort Towards Multiagent Knapsack.

Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022

Resolute control: Forbidding candidates from winning an election is hard.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).

Sushmita Gupta, Saket Saurabh, Meirav Zehavi

SIAM J. Discret. Math., 2022

Gehrlein Stable Committee with Multi-modal Preferences.

Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021

Balanced stable marriage: How close is close enough?

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2021

Parameterized Complexity of d-Hitting Set with Quotas.

Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.

Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020

Quadratic vertex kernel for split vertex deletion.

Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika

Theor. Comput. Sci., 2020

Popular Matching in Roommates Setting is NP-hard.

Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi

Bull. EATCS, 2020

Quadratic Vertex Kernel for Rainbow Matching.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Auton. Agents Multi Agent Syst., 2020

Well-Structured Committees.

Sushmita Gupta, Pallavi Jain, Saket Saurabh

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.

Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Algorithms for Swap and Shift Bribery in Structured Elections.

Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Parameterized Algorithms and Kernels for Rainbow Matching.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Algorithmica, 2019

Stability in barter exchange markets.

Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi

Auton. Agents Multi Agent Syst., 2019

On Succinct Encodings for the Tournament Fixing Problem.

Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Parameterized algorithms for stable matching with ties and incomplete lists.

Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Theor. Comput. Sci., 2018

Stable Matching Games: Manipulation via Subgraph Isomorphism.

Sushmita Gupta, Sanjukta Roy

Algorithmica, 2018

Winning a Tournament by Any Means Necessary.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

On Treewidth and Stable Marriage.

Sushmita Gupta, Saket Saurabh, Meirav Zehavi

CoRR, 2017

Group Activity Selection on Graphs: Parameterized Analysis.

Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

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

Total Stability in Stable Matching Games.

Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.

Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

Relative interval analysis of paging algorithms on access graphs.

Joan Boyar, Sushmita Gupta, Kim S. Larsen

Theor. Comput. Sci., 2015

Stable Nash Equilibria in the Gale-Shapley Matching Game.

Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki

CoRR, 2015

2012

Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.

Sushmita Gupta, Venkatesh Raman, Saket Saurabh

SIAM J. Discret. Math., 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.

Joan Boyar, Sushmita Gupta, Kim S. Larsen

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2008

Feedback arc set problem in bipartite tournaments.

Sushmita Gupta

Inf. Process. Lett., 2008

2006

Fast Exponential Algorithms for Maximum <i>r</i>-Regular Induced Subgraph Problems.

Sushmita Gupta, Venkatesh Raman, Saket Saurabh

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006