Department of Computer Science & Engineering

Research Interests :

Publications : (Last Five, while at IITM)DBLP | View All

• Parameterized algorithms for the Steiner arborescence problem on a hypercube. 
  
  Authors : Sugyani Mahapatra, Manikandan Narayanan, N.S. Narayanaswamy
  Appeared in Acta Informatica, Vol 62, No., pp.6, Jan 2025
• Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs. 
  
  Authors : N.S. Narayanaswamy, S. M. Dhannya
  Appeared in ACM Trans. Algorithms, Vol 21, No., pp.10:1-10:21, Jan 2025
• Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage. 
  
  Authors : Girish Balakrishnan, Sankardeep Chakraborty, N.S. Narayanaswamy, Kunihiko Sadakane
  Appeared in 19th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2024, June 12-14, 2024, Helsinki, Finland (SWAT 2024) ,LIPIcs, Vol 294, pp.4:1-4:16, Jun 2024
• Succinct Data Structure for Graphs with d-Dimensional t-Representation. 
  
  Authors : Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo, N.S. Narayanaswamy, Kunihiko Sadakane
  Appeared in Data Compression Conference, DCC 2024, Snowbird, UT, USA, March 19-22, 2024 (DCC 2024) ,pp.546, Mar 2024
• A Faster Algorithm for Vertex Cover Parameterized by Solution Size. 
  
  Authors : David G. Harris , N.S. Narayanaswamy
  Appeared in 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (STACS 2024) ,LIPIcs, Vol 289, pp.40:1-40:18, Mar 2024

(Recent) Teaching : View All  |  Back to top

(Current) Advisees View All  |  Back to top