S. M. Dhannya

activity

20172023

collaborators

3 papers

cs.DS2023

Exactly Hittable Interval Graphs

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

Given a set system $X = {U, S}$ , where $U$ is a set of elements and $S$ is a set of subsets of $U$ , an exact hitting se…

cs.DS2018

Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring

S. M. Dhannya, N. S. Narayanaswamy

Given a hypergraph $H$ , the conflict-free colouring problem is to colour vertices of $H$ using minimum colours so that each hyperedge in $H$ sees a unique colour. We present a poly…

math.CO2017

Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs

S. M. Dhannya, N. S. Narayanaswamy

The $k$ -Strong Conflict-Free ( $k$ -SCF, in short) colouring problem seeks to find a colouring of the vertices of a hypergraph $H$ using minimum number of colours so that in every hy…