S. M. Dhannya

According to our database, S. M. Dhannya authored at least 4 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Exactly Hittable Interval Graphs.

S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha

CoRR, 2023

2020

Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs.

S. M. Dhannya, N. S. Narayanaswamy

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2018

Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring.

S. M. Dhannya, N. S. Narayanaswamy

CoRR, 2018

Minimum Membership Hitting Sets of Axis Parallel Segments.

N. S. Narayanaswamy, S. M. Dhannya, C. Ramya

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018