Approximability of Connected Factors
Authors : Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy and C. S. Rahul
Conference : WAOA-2013 - 11th Workshop on Approximation and Online Algorithms


Connected f-Factors of Large Minimum Degree in Polynomial Time
Authors : N. S. Narayanaswamy and C. S. Rahul
Conference : ICGT-2014 - 9th International Colloquium on Graph Theory and Combinatorics


Approximation and Exact Algorithms for Special Cases of Connected f-Factors
Authors : N. S. Narayanaswamy and C. S. Rahul
Conference : CSR-2015 - The 10th International Computer Science Symposium in Russia


On the Complexity Landscape of Connected f-Factor Problems
Authors : R. Ganian, N. S. Narayanaswamy, S. Ordyniak, C. S. Rahul and M. S. Ramanujan
Conference : MFCS 2016- 41st International Symposium on Mathematical Foundations of Computer Science


Approximation Algorithms for Connected Graph Factors of Minimum Weight
Authors : Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul and Marten Waanders
Journal : (To appear in)Theory of Computing Systems