C. S. Rahul

13 papers A 1B 2Misc 1Journal 9
YearRankTypeTitle / Venue / Authors
2023 J jnl
Group Activity Selection with Few Agent Types.
Algorithmica
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2022 J jnl
Design possibilities and challenges of DNN models: a review on the perspective of end devices.
Artif. Intell. Rev.
Hanan Hussain, P. S. Tamizharasan, C. S. Rahul
2019 A conf
Group Activity Selection with Few Agent Types.
ESA
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2019 J jnl
On the Complexity Landscape of Connected f-Factor Problems.
Algorithmica
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2018 J jnl
Approximation Algorithms for Connected Graph Factors of Minimum Weight.
Theory Comput. Syst.
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders
2018 J jnl
Group Activity Selection with Few Agent Types.
CoRR
Robert Ganian, Sebastian Ordyniak, C. S. Rahul
2018 J jnl
On the Complexity Landscape of Connected f -Factor Problems.
CoRR
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2016 J jnl
A Characterization for the Existence of Connected $f$-Factors of $\textit{ Large}$ Minimum Degree.
CoRR
N. S. Narayanaswamy, C. S. Rahul
2016 B conf
On the Complexity Landscape of Connected f-Factor Problems.
MFCS
Robert Ganian, N. S. Narayanaswamy, Sebastian Ordyniak, C. S. Rahul, M. S. Ramanujan
2015 J jnl
A Classification of Connected f -factor Problems inside NP.
CoRR
N. S. Narayanaswamy, C. S. Rahul
2015 Misc conf
Approximation and Exact Algorithms for Special Cases of Connected f-Factors.
CSR
N. S. Narayanaswamy, C. S. Rahul
2013 B conf
Approximability of Connected Factors.
WAOA
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
2013 J jnl
Approximability of Connected Factors.
CoRR
Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul