| 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 | 49 | 2019 |
| 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 | 31 | 2012 |
| 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 | 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 |
| 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 | 27 | 2017 |
| 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 | 23 | 2018 |
| 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 | 18 | 2019 |
| Feedback arc set problem in bipartite tournaments S Gupta Information Processing Letters 105 (4), 150-154, 2008 | 18 | 2008 |
| 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 |
| When Rigging a Tournament, Let Greediness Blind You. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 275-281, 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 Scandinavian Workshop on Algorithm Theory, 328-339, 2012 | 13 | 2012 |
| Winning a Tournament by Any Means Necessary. S Gupta, S Roy, S Saurabh, M Zehavi IJCAI, 282-288, 2018 | 12 | 2018 |
| 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 | 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 |
| 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 | 9 | 2021 |
| 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 | 9 | 2020 |
| 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 | 8 | 2019 |
| Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules S Gupta, P Jain, S Saurabh, N Talmon | 8* | |
| Parameterized Algorithms and Kernels for Rainbow Matching S Gupta, S Roy, S Saurabh, M Zehavi Algorithmica 81 (4), 1684-1698, 2019 | 7 | 2019 |
