S. M. Dhannya

activity

20172023

most citedConflict-Free Colouring using Maximum Independent Set and Minimum Colouring

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

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★ 1 cited

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…