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 InterestsAnalysis of algorithms, Parameterized Complexity theory, Artificial Intelligence |
Current Students
See here for former students
- Anil Kumar S (Ph.D.)
- Nisha K K (Ph.D.)
Teaching Actvities (while with the theory group - since Jan 2011)
- Advanced Data Structure and Algorithms - Jul-Nov, 2023
- Discrete Mathematics for Computer Science - Feb-Mar, 2022
- Advanced Data Structures and Algorithms - Aug-Nov, 2021
- Computational Geometry - Aug-Dec, 2020
- Topics in Design and Analysis of Algorithms - Jan-May, 2020
- Topics in Design and Analysis of Algorithms - Jan-May, 2019
- Advanced Data Structures and Algorithms - Jul-Nov, 2018
- Languages, Machines and Computation - Jan-May, 2018
- Topics in Design and Analysis of Algorithms - Jul-Nov, 2017
- Advanced Data Structures and Algorithms - Aug-Nov, 2016
- Data Structures and Algorithms - Jan-Apr, 2016
- Advanced Algorithms - Jan-May, 2015
- Modern Techniques in Theory of Computation - Jan-May, 2014
- Advanced Algorithms - Jan-May, 2014
- Advanced Algorithms - Jan-May, 2013
- Advanced Programming Lab - Jul-Nov, 2012
- Advanced Data Structures & Algorithms - Jul-Nov, 2012
- Modern Techniques in Theory of Computation - Jan-Apr, 2012
- Advanced Algorithms - Jan-Apr, 2012
Publications (while with the group, last 10)
See here for all publications while at IITM
- Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Authors: Girish Balakrishnan, Sankardeep Chakraborty, Narayanaswamy N S, Kunihiko Sadakane
19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024), Vol 294, No.4, pp.1-16, Jun 2024 - Succinct Data Structure for Graphs with d-Dimensional t-Representation
Authors: Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, Narayanaswamy N S, Kunihiko Sadakane
Data Compression Conference (DCC 2024), pp.546, Mar 2024 - A faster algorithm for Vertex Cover parameterized by solution size
Authors: David Harris, Narayanaswamy N S
41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), Mar 2024 - Succinct Data Structure for Path Graphs
Authors: Girish Balakrishnan, Sankardeep Chakraborty, Narayanaswamy N S, Kunihiko Sadakane
Information and Computation, Vol 105124, Jan 2024 - Trade-Offs in Dynamic Coloring for Bipartite and General Graphs
Authors: Manas Jyothi Kashyap, Narayanaswamy N S, Meghana Nasre, Sai Mohith Potluri
Algorithmica, Vol 85, No.4, pp.854--878, Jan 2023 - Succinct Data Structure for Path Graphs
Authors: Girish Balakrishnan, Sankardeep Chakraborty, Narayanaswamy N S, Kunihiko Sadakane
Data Compression Conference (DCC 2022), Mar 2022 - 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 - The Connected Domination Number of Grids
Authors: Narayanaswamy N S, Adarsh Srinivasan
7th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2021), Feb 2021 - Perfect resolution for Conflict-Free Colouring of Interval Hypergraphs
Authors: Dhannya S.M., Narayanaswamy N S
The 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Mar 2020