19 citations · 31 across the 26 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018
On the Complexity Landscape of Connected f -Factor Problems
R. Ganian, N. S. Narayanaswamy, S. Ordyniak +2
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a…
cs.DS2018★ 1 cited
Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring
S. M. Dhannya, N. S. Narayanaswamy
Given a hypergraph , the conflict-free colouring problem is to colour vertices of using minimum colours so that each hyperedge in sees a unique colour. We present a poly…
cs.DS2018
Fully dynamic approximate maximum cardinality matching in update time
Manas Jyoti Kashyop, N. S. Narayanaswamy
We present a randomized algorithm to maintain a maximal matching without 3 length augmenting paths in the fully dynamic setting. Consequently, we maintain a approximate maxim…