Popular matching in roommates setting is NP-hard S Gupta, P Misra, S Saurabh, M Zehavi ACM Transactions on Computation Theory (TOCT) 13 (2), 1-20, 2021 | 53 | 2021 |
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 | 35 | 2012 |
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 | 30 | 2017 |
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems S Gupta, V Raman, S Saurabh FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006 | 30 | 2006 |
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 | 28 | 2013 |
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 | 25 | 2018 |
Balanced stable marriage: How close is close enough? S Gupta, S Roy, S Saurabh, M Zehavi Theoretical Computer Science 883, 19-43, 2021 | 19 | 2021 |
Feedback arc set problem in bipartite tournaments S Gupta Information Processing Letters 105 (4), 150-154, 2008 | 18 | 2008 |
When Rigging a Tournament, Let Greediness Blind You. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 275-281, 2018 | 16 | 2018 |
On the (parameterized) complexity of almost stable marriage S Gupta, P Jain, S Roy, S Saurabh, M Zehavi arXiv preprint arXiv:2005.08150, 2020 | 14 | 2020 |
Winning a Tournament by Any Means Necessary. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 282-288, 2018 | 14 | 2018 |
On treewidth and stable marriage S Gupta, S Saurabh, M Zehavi arXiv preprint arXiv:1707.05404, 2017 | 13 | 2017 |
Access graphs results for LRU versus FIFO under relative worst order analysis J Boyar, S Gupta, KS Larsen Algorithm Theory–SWAT 2012: 13th Scandinavian Symposium and Workshops …, 2012 | 13 | 2012 |
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, 476-499, 2016 | 12 | 2016 |
Group activity selection on graphs: parameterized analysis S Gupta, S Roy, S Saurabh, M Zehavi International Symposium on Algorithmic Game Theory, 106-118, 2017 | 11 | 2017 |
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 | 10 | 2019 |
Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules S Gupta, P Jain, S Saurabh, N Talmon Algorithmica 85 (12), 3717-3740, 2023 | 9 | 2023 |
Gerrymandering on graphs: computational complexity and parameterized algorithms S Gupta, P Jain, F Panolan, S Roy, S Saurabh Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus …, 2021 | 9 | 2021 |
Algorithms for swap and shift bribery in structured elections E Elkind, P Faliszewski, S Gupta, S Roy International Foundation for Autonomous Agents and Multiagent Systems, 2020 | 9 | 2020 |
On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization) S Gupta, S Saurabh, M Zehavi SIAM Journal on Discrete Mathematics 36 (1), 596-681, 2022 | 7 | 2022 |