C. S. Rahul

According to our database, C. S. Rahul authored at least 10 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

Algorithmica, September, 2023

Group Activity Selection with Few Agent Types.

Robert Ganian, Sebastian Ordyniak, C. S. Rahul

Algorithmica, May, 2023

2022

Design possibilities and challenges of DNN models: a review on the perspective of end devices.

Hanan Hussain, P. S. Tamizharasan, C. S. Rahul

Artif. Intell. Rev., 2022

2020

Graph Homomorphism Polynomials: Algorithms and Complexity.

Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

CoRR, 2020

2019

On the Complexity Landscape of Connected f-Factor Problems.

Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan

Algorithmica, 2019

2018

Approximation Algorithms for Connected Graph Factors of Minimum Weight.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders

Theory Comput. Syst., 2018

2016

A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree.

N. S. Narayanaswamy, C. S. Rahul

CoRR, 2016

2015

A Classification of Connected f -factor Problems inside NP.

N. S. Narayanaswamy, C. S. Rahul

CoRR, 2015

Approximation and Exact Algorithms for Special Cases of Connected f-Factors.

N. S. Narayanaswamy, C. S. Rahul

Proceedings of the Computer Science - Theory and Applications, 2015

2013

Approximability of Connected Factors.

Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013