Follow
Dhannya S M
Title
Cited by
Cited by
Year
Minimum membership hitting sets of axis parallel segments
NS Narayanaswamy, SM Dhannya, C Ramya
Computing and Combinatorics: 24th International Conference, COCOON 2018 …, 2018
22018
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs
SM Dhannya, NS Narayanaswamy
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
12020
Conflict-free colouring using maximum independent set and minimum colouring
SM Dhannya, NS Narayanaswamy
arXiv preprint arXiv:1812.01459, 2018
12018
Exactly Hittable Interval Graphs
KKN SM Dhannya, NS Narayanaswamy
The 11th International Colloquium on Graph Theory and combinatorics (ICGT 2022), 2022
2022
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs
SM Dhannya, NS Narayanaswamy
arXiv preprint arXiv:1707.05071, 2017
2017
Optimal conflict-free colouring with respect to a subset of intervals
SM Dhannya, NS Narayanaswamy
arXiv preprint arXiv:1707.05071, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–6