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 InterestsGraph Algorithms, Parameterized ComplexityMoved to:Faculty, IIIT Sri City, AP, India. |
Teaching Actvities (while with the theory group - since Jan 2011)
- TA for Advanced Algorithms - Jan-May, 2013
- TA for Advanced Programming Lab - Jul-Nov, 2012
Publications (while with the group, last 10)
See here for all publications while at IITM
- Approximate Distance Oracle in O(n^2) Time and O(n) Space for Chordal Graphs
Authors: Gaurav Singh, Narayanaswamy N S, Ramakrishna G.
Workshop on Algorithms and Computation, Feb 2015 - On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
Authors: Narayanaswamy N S, Ramakrishna G.
Accepted at Theoretical Computer Scince 2014, Nov 2014 - Tree t-spanners in Outerplanar Graphs via Supply Demand Partition
Authors: Narayanaswamy N S, Ramakrishna G.
Accepted at Discrete Applied Mathematics 2014, Oct 2014 - Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
Authors: Carola Doerr, Ramakrishna G., Jens M. Schmidt
Accepted at Journal of Graph Algorithms and Applications (JGAA), May 2014 - Characterization of Minimum Cycle Basis in Weighted Partial 2-trees.
Authors: Narayanaswamy N S, Ramakrishna G.
Accepted at Discrete Applied Mathematics, CoRR abs/1302.5889 (2013), Apr 2014 - On Minimum Average Stretch Spanning Trees in Polygonal 2-trees
Authors: Narayanaswamy N S, Ramakrishna G.
Accepted at Workshop on Algorithms and Computation 2014, Oct 2013 - Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
Authors: Carola Doerr, Ramakrishna G., Jens M. Schmidt
39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2013), Aug 2013 - Characterization of Minimum Cycle Basis in Weighted Partial 2-trees
Authors: Narayanaswamy N S, Ramakrishna G.
Cologne-Twente Workshop (CTW), May 2012