Author

C. S. Rahul

Observed names: Rahul C. S., Rahul, C S, Rahul, C. S.

Institution: Indian Institute of Technology Goa

Observed institutions: Indian Institute of Technology Madras, Indian Institute of Technology Goa, Birla Institute of Technology and Science, Pilani - Dubai Campus, University of Warsaw

ORCID: 0000-0002-6199-7583

Observed ORCID: 0000-0002-6199-7583

OpenAlex ID: A5109425857

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

2022 · Hanan Hussain, P. S. Tamizharasan, et al. · Artificial Intelligence Review · 120

Approximability of Connected Factors

2014 · Kamiel Cornelissen, Ruben Hoeksma, et al. · Lecture notes in computer science · 9

PDF

Productivity Improvement and Reduction of Lead Time in Manufacturing Industry Using Lean Tools

2021 · Sivaraman Parthasarathi, Prabhu M. K., et al. · Industrial Engineering · 7

PDF

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials

2023 · Balagopal Komarath, Anurag Pandey, et al. · Algorithmica · 6

Approximation Algorithms for Connected Graph Factors of Minimum Weight

2016 · Kamiel Cornelissen, Ruben Hoeksma, et al. · Theory of Computing Systems · 5

PDF

Group Activity Selection with Few Agent Types

2022 · Robert Ganian, Sebastian Ordyniak, et al. · Algorithmica · 4

Group Activity Selection with Few Agent Types

2018 · Ganian, Robert, Ordyniak, Sebastian, et al. · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · 4

PDF

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

2015 · N. S. Narayanaswamy, C. S. Rahul · Lecture notes in computer science · 3

On the Complexity Landscape of Connected f-Factor Problems

2019 · R. Ganian, N. S. Narayanaswamy, et al. · Algorithmica · 2

PDF

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

2016 · Narayanaswamy, N S, Rahul, C S · arXiv (Cornell University)

PDF

On the Complexity Landscape of Connected f-Factor Problems

2016 · Ganian, Robert, Narayanaswamy, N. S., et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

PDF

A Classification of Connected f -factor Problems inside NP

2015 · Narayanaswamy, N. S., Rahul, C. S. · arXiv (Cornell University)

PDF

Works count: 12

Citation count: 160

H-index: 5

I10-index: 1