Sushmita Gupta

77 papers A* 8A 4B 13C 2Misc 1Journal 40Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes.
CoRR
Umang Bhaskar, Juhi Chaudhary, Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2026 J jnl
When agents choose bundles autonomously: guarantees beyond discrepancy.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 B conf
A Simple Algorithm for Combinatorial n-Fold ILPs Using the Steinitz Lemma.
IPEC
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 J jnl
A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman, Meirav Zehavi
2025 J jnl
Budget-feasible egalitarian allocation of conflicting jobs.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2025 A* conf
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules.
IJCAI
Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025 J jnl
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules.
CoRR
Sushmita Gupta, Pallavi Jain, Souvik Saha, Saket Saurabh, Anannya Upasana
2025 — conf
Parameterized Complexity of Disconnected Matchings.
CIAC (2)
Sushmita Gupta, Pallavi Jain, Lawqueen Kanesh, Sounak Modak, Saket Saurabh
2025 B conf
Tractable Graph Structures in EFX Orientation.
SAGT
Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2025 J jnl
Tractable Graph Structures in EFX Orientation.
CoRR
Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024 A* conf
An Exercise in Tournament Design: When Some Matches Must Be Scheduled.
AAAI
Sushmita Gupta, Ramanujan Sridharan, Peter Strulo
2024 J jnl
An Exercise in Tournament Design: When Some Matches Must Be Scheduled.
CoRR
Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024 A conf
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
AAMAS
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 J jnl
Budget-feasible Egalitarian Allocation of Conflicting Jobs.
CoRR
Sushmita Gupta, Pallavi Jain, A. Mohanapriya, Vikash Tripathi
2024 J jnl
Conflict and Fairness in Resource Allocation.
CoRR
Susobhan Bandopadhyay, Aritra Banik, Sushmita Gupta, Pallavi Jain, Abhishek Sahu, Saket Saurabh, Prafullkumar Tale
2024 — conf
Manipulation With(out) Money in Matching Market.
ADT
Sushmita Gupta, Pallavi Jain
2024 B conf
On Controlling Knockout Tournaments Without Perfect Information.
IPEC
Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024 J jnl
On Controlling Knockout Tournaments Without Perfect Information.
CoRR
Václav Blazej, Sushmita Gupta, M. S. Ramanujan, Peter Strulo
2024 — conf
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.
LATIN (1)
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
2024 J jnl
Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.
CoRR
Sushmita Gupta, Sounak Modak, Saket Saurabh, Sanjay Seetharaman
2024 — conf
When Far Is Better: The Chamberlin-Courant Approach to Obnoxious Committee Selection.
FSTTCS
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2024 J jnl
When far is better: The Chamberlin-Courant approach to obnoxious committee selection.
CoRR
Sushmita Gupta, Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh
2023 J jnl
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
Algorithmica
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2023 J jnl
How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach.
CoRR
Sushmita Gupta, Pallavi Jain, Saket Saurabh
2023 B conf
More Effort Towards Multiagent Knapsack.
SOFSEM
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2022 B conf
Gehrlein Stable Committee with Multi-modal Preferences.
SAGT
Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh
2022 J jnl
More Effort Towards Multiagent Knapsack.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman
2022 J jnl
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).
SIAM J. Discret. Math.
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2022 Misc conf
Parameterized Analysis for the Group Activity Selection Problem on Graphs.
ISAIM
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2022 J jnl
Resolute control: Forbidding candidates from winning an election is hard.
Theor. Comput. Sci.
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021 J jnl
Balanced stable marriage: How close is close enough?
Theor. Comput. Sci.
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2021 A* conf
Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules.
IJCAI
Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon
2021 B conf
Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
SAGT
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021 J jnl
Gerrymandering on graphs: Computational complexity and parameterized algorithms.
CoRR
Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh
2021 B conf
Parameterized Complexity of d-Hitting Set with Quotas.
SOFSEM
Sushmita Gupta, Pallavi Jain, Aditya Petety, Sagar Singh
2021 J jnl
Popular Matching in Roommates Setting Is NP-hard.
ACM Trans. Comput. Theory
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020 A conf
Algorithms for Swap and Shift Bribery in Structured Elections.
AAMAS
Edith Elkind, Piotr Faliszewski, Sushmita Gupta, Sanjukta Roy
2020 J jnl
Gehrlein stability in committee selection: parameterized hardness and algorithms.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 — conf
On the (Parameterized) Complexity of Almost Stable Marriage.
FSTTCS
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 J jnl
On the (Parameterized) Complexity of Almost Stable Marriage.
CoRR
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 J jnl
Popular Matching in Roommates Setting is NP-hard.
Bull. EATCS
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2020 J jnl
Quadratic Vertex Kernel for Rainbow Matching.
Algorithmica
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2020 J jnl
Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci.
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2020 A* conf
Well-Structured Committees.
IJCAI
Sushmita Gupta, Pallavi Jain, Saket Saurabh
2019 B conf
Balanced Stable Marriage: How Close Is Close Enough?
WADS
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019 A conf
Gehrlein Stability in Committee Selection: Parameterized Hardness and Algorithms.
AAMAS
Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019 A* conf
On Succinct Encodings for the Tournament Fixing Problem.
IJCAI
Sushmita Gupta, Saket Saurabh, Ramanujan Sridharan, Meirav Zehavi
2019 J jnl
Parameterized Algorithms and Kernels for Rainbow Matching.
Algorithmica
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2019 A* conf
Popular Matching in Roommates Setting is NP-hard.
SODA
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019 C conf
Quadratic Vertex Kernel for Split Vertex Deletion.
CIAC
Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika
2019 J jnl
Stability in barter exchange markets.
Auton. Agents Multi Agent Syst.
Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018 J jnl
Parameterized algorithms for stable matching with ties and incomplete lists.
Theor. Comput. Sci.
Deeksha Adil, Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018 J jnl
Popular Matching in Roommates Setting is NP-hard.
CoRR
Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2018 A conf
Stability in Barter Exchange Markets.
AAMAS
Sushmita Gupta, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2018 J jnl
Stable Matching Games: Manipulation via Subgraph Isomorphism.
Algorithmica
Sushmita Gupta, Sanjukta Roy
2018 A* conf
When Rigging a Tournament, Let Greediness Blind You.
IJCAI
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2018 A* conf
Winning a Tournament by Any Means Necessary.
IJCAI
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017 J jnl
Balanced Stable Marriage: How Close is Close Enough?
CoRR
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017 B conf
Group Activity Selection on Graphs: Parameterized Analysis.
SAGT
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2017 J jnl
On Treewidth and Stable Marriage.
CoRR
Sushmita Gupta, Saket Saurabh, Meirav Zehavi
2017 B conf
Parameterized Algorithms and Kernels for Rainbow Matching.
MFCS
Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi
2016 B conf
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.
IPEC
Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma
2016 J jnl
On the Advice Complexity of the k-server Problem Under Sparse Metrics.
Theory Comput. Syst.
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
2016 — conf
Stable Matching Games: Manipulation via Subgraph Isomorphism.
FSTTCS
Sushmita Gupta, Sanjukta Roy
2016 — conf
Total Stability in Stable Matching Games.
SWAT
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
2015 J jnl
Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci.
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2015 J jnl
Stable Nash Equilibria in the Gale-Shapley Matching Game.
CoRR
Sushmita Gupta, Kazuo Iwama, Shuichi Miyazaki
2013 J jnl
On Advice Complexity of the k-server Problem under Sparse Metrics
CoRR
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
2013 B conf
On Advice Complexity of the k-server Problem under Sparse Metrics.
SIROCCO
Sushmita Gupta, Shahin Kamali, Alejandro López-Ortiz
2013 J jnl
Relative Interval Analysis of Paging Algorithms on Access Graphs
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2013 B conf
Relative Interval Analysis of Paging Algorithms on Access Graphs.
WADS
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 J jnl
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
CoRR
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 — conf
Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
SWAT
Joan Boyar, Sushmita Gupta, Kim S. Larsen
2012 J jnl
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.
SIAM J. Discret. Math.
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
2008 J jnl
Feedback arc set problem in bipartite tournaments.
Inf. Process. Lett.
Sushmita Gupta
2007 C conf
Feedback Arc Set Problem in Bipartite Tournaments.
TAMC
Sushmita Gupta
2006 — conf
Fast Exponential Algorithms for Maximum
FSTTCS
Sushmita Gupta, Venkatesh Raman, Saket Saurabh