Disclaimer : This page lists only the information about the individual member relevant to the theory group activities. Please visit the individual's page (using the link above) for broader profile information.
Research InterestsComplexity of Domination under UncertaintyMoved to:Postdoctoral Fellow |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Topics in Design and Analysis of Algorithms - Jan-Apr, 2018
- TA for Topics in Design and Analysis of Algorithms - Jan-Apr, 2017
- TA for Topics in Design and Analysis of Algorithms - Aug-Nov, 2015
Publications (while with the group, last 10)
See here for all publications while at IITM
- Parameterized Complexity of Minimum Membership Dominating Set
Authors: Akanksha Agrawal, Pratibha Choudhary, Narayanaswamy N S, Nisha K K, Vijayaraghunathan Ramamoorthi
WALCOM, Mar 2022 - Budgeted Dominating Sets in Uncertain Graphs
Authors: Narayanaswamy N S, David Peleg, Vijayaraghunathan Ramamoorthi, Keerti Choudhary, Avi Cohen
46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Aug 2021 - On the Parameterized Complexity of the Expected Coverage Problem
Authors: Fedor Fomin, Vijayaraghunathan Ramamoorthi
15th International Computer Science Symposium in Russia (CSR 2020), (Best Paper Award in CSR 2020), Jun 2020 - Facility location on planar graphs with unreliable links
Authors: Narayanaswamy N S, Meghana Nasre, Vijayaraghunathan Ramamoorthi
The 13th International Computer Science Symposium in Russia, Jun 2018