Sushmita Gupta

Orcid: 0000-0003-1255-8266

Affiliations:
  • Institute of Mathematical Sciences, Chennai, India


According to our database1, Sushmita Gupta authored at least 39 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Conflict and Fairness in Resource Allocation.
CoRR, 2024

Budget-feasible Egalitarian Allocation of Conflicting Jobs.
CoRR, 2024

Quick-Sort Style Approximation Algorithms for Generalizations of Feedback Vertex Set in Tournaments.
Proceedings of the LATIN 2024: Theoretical Informatics, 2024

An Exercise in Tournament Design: When Some Matches Must Be Scheduled.
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.
Algorithmica, December, 2023

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

More Effort Towards Multiagent Knapsack.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2022
Resolute control: Forbidding candidates from winning an election is hard.
Theor. Comput. Sci., 2022

On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).
SIAM J. Discret. Math., 2022

Gehrlein Stable Committee with Multi-modal Preferences.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Parameterized Analysis for the Group Activity Selection Problem on Graphs.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics 2022 (ISAIM 2022), 2022

2021
Balanced stable marriage: How close is close enough?
Theor. Comput. Sci., 2021

Parameterized Complexity of d-Hitting Set with Quotas.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020
Quadratic vertex kernel for split vertex deletion.
Theor. Comput. Sci., 2020

Popular Matching in Roommates Setting is NP-hard.
Bull. EATCS, 2020

Quadratic Vertex Kernel for Rainbow Matching.
Algorithmica, 2020

Gehrlein stability in committee selection: parameterized hardness and algorithms.
Auton. Agents Multi Agent Syst., 2020

Well-Structured Committees.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

On the (Parameterized) Complexity of Almost Stable Marriage.
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.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Parameterized Algorithms and Kernels for Rainbow Matching.
Algorithmica, 2019

Stability in barter exchange markets.
Auton. Agents Multi Agent Syst., 2019

On Succinct Encodings for the Tournament Fixing Problem.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Parameterized algorithms for stable matching with ties and incomplete lists.
Theor. Comput. Sci., 2018

Stable Matching Games: Manipulation via Subgraph Isomorphism.
Algorithmica, 2018

Winning a Tournament by Any Means Necessary.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

When Rigging a Tournament, Let Greediness Blind You.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
On Treewidth and Stable Marriage.
CoRR, 2017

Group Activity Selection on Graphs: Parameterized Analysis.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
On the Advice Complexity of the k-server Problem Under Sparse Metrics.
Theory Comput. Syst., 2016

Total Stability in Stable Matching Games.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015
Relative interval analysis of paging algorithms on access graphs.
Theor. Comput. Sci., 2015

Stable Nash Equilibria in the Gale-Shapley Matching Game.
CoRR, 2015

2012
Maximum r-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds.
SIAM J. Discret. Math., 2012

Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2008
Feedback arc set problem in bipartite tournaments.
Inf. Process. Lett., 2008

2006
Fast Exponential Algorithms for Maximum <i>r</i>-Regular Induced Subgraph Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006


  Loading...