Listing last 25 publications.
- On the Complexity Landscape of Connected f-factor Problems
Robert Ganian, Narayanaswamy N S, Sebastian Ordyniak, Rahul C.S., M S Ramanujan, Appeared in 41st International Symposium on Mathematical Foundations of Computer Science (MFCS),
- Approximation and Exact Algorithms for special cases of Connected f-Factors
Narayanaswamy N S, Rahul C.S., Appeared in 10th International Computer Science Symposium in Russia,
- Connected f-Factors of Large Minimum Degree in Polynomial Time.
Narayanaswamy N S, Rahul C.S., Appeared in 9th International Colloquium on Graph Theory and Combinatorics (ICGT 2014),
- Approximability of Connected Factors
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, Narayanaswamy N S, Rahul C.S., Appeared in 11th Workshop on Approximation and Online Algorithms (WAOA),