Follow
Sushmita Gupta
Title
Cited by
Cited by
Year
Popular Matching in Roommates Setting is NP-hard
S Gupta, P Misra, S Saurabh, M Zehavi
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
322019
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
S Gupta, V Raman, S Saurabh
International Conference on Foundations of Software Technology and …, 2006
292006
Maximum -Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
S Gupta, V Raman, S Saurabh
SIAM Journal on Discrete Mathematics 26 (4), 1758-1780, 2012
282012
On Advice Complexity of the k-server Problem under Sparse Metrics
S Gupta, S Kamali, A López-Ortiz
International Colloquium on Structural Information and Communication …, 2013
262013
Improved algorithms and combinatorial bounds for independent feedback vertex set
A Agrawal, S Gupta, S Saurabh, R Sharma
11th International Symposium on Parameterized and Exact Computation (IPEC 2016), 2017
202017
Feedback arc set problem in bipartite tournaments
S Gupta
Information Processing Letters 105 (4), 150-154, 2008
162008
Balanced Stable Marriage: How Close Is Close Enough?
S Gupta, S Roy, S Saurabh, M Zehavi
Workshop on Algorithms and Data Structures, 423-437, 2019
132019
Parameterized algorithms for stable matching with ties and incomplete lists
D Adil, S Gupta, S Roy, S Saurabh, M Zehavi
Theoretical Computer Science 723, 1-10, 2018
132018
Access graphs results for LRU versus FIFO under relative worst order analysis
J Boyar, S Gupta, KS Larsen
Scandinavian Workshop on Algorithm Theory, 328-339, 2012
132012
On Treewidth and Stable Marriage
S Gupta, S Saurabh, M Zehavi
arXiv preprint arXiv:1707.05404, 2017
122017
On the Advice Complexity of the k-server Problem Under Sparse Metrics
S Gupta, S Kamali, A López-Ortiz
Theory of Computing Systems 59 (3), 476-499, 2016
122016
When Rigging a Tournament, Let Greediness Blind You.
S Gupta, S Roy, S Saurabh, M Zehavi
IJCAI, 275-281, 2018
112018
Group activity selection on graphs: parameterized analysis
S Gupta, S Roy, S Saurabh, M Zehavi
International Symposium on Algorithmic Game Theory, 106-118, 2017
102017
On the (Parameterized) Complexity of Almost Stable Marriage
S Gupta, P Jain, S Roy, S Saurabh, M Zehavi
arXiv preprint arXiv:2005.08150, 2020
82020
Algorithms for Swap and Shift Bribery in Structured Elections
E Elkind, P Faliszewski, S Gupta, S Roy
Proceedings of the 19th International Conference on Autonomous Agents and …, 2020
72020
Winning a Tournament by Any Means Necessary.
S Gupta, S Roy, S Saurabh, M Zehavi
IJCAI, 282-288, 2018
72018
Relative interval analysis of paging algorithms on access graphs
J Boyar, S Gupta, KS Larsen
Theoretical Computer Science 568, 28-48, 2015
72015
Stable Nash Equilibria in the Gale-Shapley Matching Game
S Gupta, K Iwama, S Miyazaki
arXiv preprint arXiv:1509.04344, 2015
62015
Gerrymandering on graphs: Computational complexity and parameterized algorithms
S Gupta, P Jain, F Panolan, S Roy, S Saurabh
International Symposium on Algorithmic Game Theory, 140-155, 2021
52021
On succinct encodings for the tournament fixing problem
S Gupta, S Saurabh, R Sridharan, M Zehavi
Proceedings of the 28th International Joint Conference on Artificial …, 2019
42019
The system can't perform the operation now. Try again later.
Articles 1–20