NEWS

MS & PhD in Computer Science and Engineering, IIT Madras

Areas of Research

Analysis of algorithms, Hardness of combinatorial problems, Approximation algorithms, Optimal algorithms, Graph Algorithms, Coloring problems in perfect graphs

Selected Publications:

1. Minimum membership hitting sets of axis parallel segments

NS Narayanaswamy, SM Dhannya, C Ramya

Computing and Combinatorics: 24th International Conference, COCOON 2018

2. Exactly Hittable Interval Graphs

KK Nisha SM Dhannya, NS Narayanaswamy

The 11th International Colloquium on Graph Theory and combinatorics (ICGT 2022)

3. Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs

SM Dhannya, NS Narayanaswamy

37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020)

Google Scholar :

https://scholar.google.com/citations?user=6DS5rGAAAAAJ

LinkedIn :

https://in.linkedin.com/in/dhannya-sm-08393396