| On the Parameterized Complexity of Deletion to -free Strong Components R Neogi, MS Ramanujan, S Saurabh, R Sharma arXiv preprint arXiv:2005.01359, 2020 | 5 | 2020 |
| Exact and Parameterized Algorithms for (k, i)-Coloring D Majumdar, R Neogi, V Raman, P Tale Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 4 | 2017 |
| Tractability of König edge deletion problems D Majumdar, R Neogi, V Raman, S Vaishali Theoretical Computer Science 796, 207-215, 2019 | 2 | 2019 |
| Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints R Neogi, K Pashkovich, C Swamy 15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024 | | 2024 |
| Recognizing k-clique extendible orderings M Francis, R Neogi, V Raman Algorithmica 83 (11), 3338-3362, 2021 | | 2021 |
| Decomposition-based methods for Connectivity Augmentation Problems R Neogi University of Waterloo, 2021 | | 2021 |
Venkatesh RamanProfessor, IMSc ChennaiVerified email at imsc.res.in
