| Facility location on planar graphs with unreliable links NS Narayanaswamy, M Nasre, R Vijayaragunathan International Computer Science Symposium in Russia, 269-281, 2018 | 6 | 2018 |
| On solution discovery via reconfiguration MR Fellows, M Grobler, N Megow, AE Mouawad, V Ramamoorthi, ... arXiv preprint arXiv:2304.14295, 2023 | 3 | 2023 |
| Parameterized Optimization in Uncertain Graphs—A Survey and Some Results NS Narayanaswamy, R Vijayaragunathan Algorithms 13 (1), 3, 2019 | 2 | 2019 |
| Solution discovery via reconfiguration for problems in P M Grobler, S Maaz, N Megow, AE Mouawad, V Ramamoorthi, D Schmand, ... arXiv preprint arXiv:2311.13478, 2023 | 1 | 2023 |
| Parameterized complexity of minimum membership dominating set A Agrawal, P Choudhary, NS Narayanaswamy, KK Nisha, V Ramamoorthi Algorithmica 85 (11), 3430-3452, 2023 | 1 | 2023 |
| On the Parameterized Complexity of the Expected Coverage Problem FV Fomin, V Ramamoorthi Theory of Computing Systems 66 (2), 432-453, 2022 | | 2022 |
| Parameterized and Approximation Algorithms for the Steiner Arborescence Problem on a Hypercube S Mahapatra, M Narayanan, NS Narayanaswamy, V Ramamoorthi arXiv preprint arXiv:2110.02830, 2021 | | 2021 |
| Budgeted Dominating Sets in Uncertain Graphs K Choudhary, A Cohen, NS Narayanaswamy, D Peleg, ... arXiv preprint arXiv:2107.03020, 2021 | | 2021 |
| Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube. S Mahapatra, M Narayanan, NS Narayanaswamy, V Ramamoorthi CoRR, 2021 | | 2021 |
| On the Parameterized Complexity of the Expected Coverage Problem FV Fomin, V Ramamoorthi International Computer Science Symposium in Russia, 224-236, 2020 | | 2020 |
Narayanaswamy N SIIT MadrasVerified email at cse.iitm.ac.in
Narayanaswamy N SIIT MadrasVerified email at cse.iitm.ac.in