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 InterestsParameterized ComplexityMoved to:Postdoc, IMSc, Chennai. |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Advanced Algorithms - Jan-May, 2015
- TA for Mathematical Concepts for Computer Science - Jul-Nov, 2014
- TA for Modern Techniques in Theory of Computation - Jan-May, 2014
- TA for Advanced Algorithms - Jan-May, 2013
- TA for Advanced Data Structures & Algorithms - Jul-Nov, 2012
- TA for Advanced Complexity Theory - Jan-Apr, 2012
Publications (while with the group, last 10)
See here for all publications while at IITM
- LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs
Authors: Samuel Fiorini, Krithika Ramaswamy, Narayanaswamy N S, Venkatesh Raman
22nd European Symposium on Algorithms, Sep 2014 - Another Disjoint Compression Algorithm for OCT
Authors: Narayanaswamy N S, Krithika Ramaswamy
Information Processing Letters., Vol 113, No.22, pp.849–851, Nov 2013 - A Dirac-type Characterization of k-chordal Graphs
Authors: Krithika Ramaswamy, Rogers Mathew, Narayanaswamy N S, Sadagopan Narasimhan
Accepted at Discrete Mathematics, Jul 2013 - Parameterized Algorithms for (r,l)-Partization
Authors: Narayanaswamy N S, Krithika Ramaswamy
Journal of Graph Algorithms and Applications (JGAA), Vol 17, No.2, pp.129--146, Jan 2013