2 papers
cs.DS2025
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…
cs.DS2024
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…