S. M. Dhannya

Orcid: 0000-0002-0302-7458

According to our database1, S. M. Dhannya authored at least 5 papers between 2018 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2018
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs.
ACM Trans. Algorithms, January, 2025

2023
Exactly Hittable Interval Graphs.
Discret. Math. Theor. Comput. Sci., 2023

2020
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2018
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring.
CoRR, 2018

Minimum Membership Hitting Sets of Axis Parallel Segments.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018


  Loading...