Approximability of Connected Factors. - Kamiel Cornelissen; Ruben Hoeksma; Bodo Manthey; N. S. Narayanaswamy; C. S. Rahul 001 (WAOA, 2013)

Approximation and Exact Algorithms for Special Cases of Connected f-Factors. - N. S. Narayanaswamy; C. S. Rahul 001 (CSR, 2015)

A Classification of Connected f -factor Problems inside NP. - N. S. Narayanaswamy; C. S. Rahul 001 (CoRR, 2015)

A Characterization for the Existence of Connected $f$-Factors of $ textit{ Large}$ Minimum Degree. - N. S. Narayanaswamy; C. S. Rahul 001 (CoRR, 2016)

Approximation Algorithms for Connected Graph Factors of Minimum Weight. - Kamiel Cornelissen; Ruben Hoeksma; Bodo Manthey; N. S. Narayanaswamy; C. S. Rahul 001; Marten Waanders (Theory Comput. Syst., 2018)

On the Complexity Landscape of Connected f-Factor Problems. - Robert Ganian; N. S. Narayanaswamy; Sebastian Ordyniak; C. S. Rahul 001; M. S. Ramanujan 001 (Algorithmica, 2019)

Graph Homomorphism Polynomials: Algorithms and Complexity. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (CoRR, 2020)

Design possibilities and challenges of DNN models: a review on the perspective of end devices. - Hanan Hussain; P. S. Tamizharasan; C. S. Rahul 001 (Artif. Intell. Rev., 2022)

Group Activity Selection with Few Agent Types. - Robert Ganian; Sebastian Ordyniak; C. S. Rahul 001 (Algorithmica, 2023)

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. - Balagopal Komarath; Anurag Pandey 001; Chengot Sankaramenon Rahul (Algorithmica, 2023)