C. S. Rahul

Orcid: 0000-0002-6199-7583

Affiliations:
  • Indian Institute of Technology Goa, Department of Computer Science, Ponda


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials.
Algorithmica, September, 2023

Group Activity Selection with Few Agent Types.
Algorithmica, May, 2023

2022
Design possibilities and challenges of DNN models: a review on the perspective of end devices.
Artif. Intell. Rev., 2022

2020
Graph Homomorphism Polynomials: Algorithms and Complexity.
CoRR, 2020

2019
On the Complexity Landscape of Connected f-Factor Problems.
Algorithmica, 2019

2018
Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Theory Comput. Syst., 2018

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

2015
A Classification of Connected f -factor Problems inside NP.
CoRR, 2015

Approximation and Exact Algorithms for Special Cases of Connected f-Factors.
Proceedings of the Computer Science - Theory and Applications, 2015

2013
Approximability of Connected Factors.
Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013


  Loading...