19 citations · 31 across the 26 of their papers we have counts for
29 papers
Exactly Hittable Interval Graphs
S. M. Dhannya, N. S. Narayanaswamy, K. K. Nisha
Given a set system , where is a set of elements and is a set of subsets of , an exact hitting se…
A faster algorithm for Vertex Cover parameterized by solution size
David G. Harris, N. S. Narayanaswamy
We describe a new algorithm for vertex cover with runtime , where is the size of the desired solution and hides polynomial factors in the input size. This…
Succinct Data Structure for Path Graphs
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We consider the problem of designing a succinct data structure for {\it path graphs} (which are a proper subclass of chordal graphs and a proper superclass of interval graphs) on $…
Parameterized Complexity of Minimum Membership Dominating Set
Akanksha Agrawal, Pratibha Choudhary, N. S. Narayanaswamy +2
Given a graph and an integer , the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set of such that for each ,…
Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
Sugyani Mahapatra, Manikandan Narayanan, N S Narayanaswamy
Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes (MSA-DH). Given , representing…
Budgeted Dominating Sets in Uncertain Graphs
Keerti Choudhary, Avi Cohen, N. S. Narayanaswamy +2
We study the {\em Budgeted Dominating Set} (BDS) problem on uncertain graphs, namely, graphs with a probability distribution associated with the edges, such that an edge ex…