( en | de | ru )

 

Disambiguation of "Rahul, C. S."

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity Landscape of Connected f-Factor Problems.

, , , , and . Algorithmica, 81 (6): 2606-2632 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rahul M S

S C Jones

Solveig C S Eschen

Christian S c rea

Solveig C S Eschen

 

Other publications of authors with the same name

A Classification of Connected f -factor Problems inside NP., and . CoRR, (2015)Approximation and Exact Algorithms for Special Cases of Connected f-Factors., and . CSR, volume 9139 of Lecture Notes in Computer Science, page 350-363. Springer, (2015)Design possibilities and challenges of DNN models: a review on the perspective of end devices., , and . Artif. Intell. Rev., 55 (7): 5109-5167 (2022)On the Complexity Landscape of Connected f-Factor Problems., , , , and . Algorithmica, 81 (6): 2606-2632 (2019)A Characterization for the Existence of Connected $f$-Factors of $ Large$ Minimum Degree., and . CoRR, (2016)On the Complexity Landscape of Connected f -Factor Problems., , , , and . CoRR, (2018)Group Activity Selection with Few Agent Types., , and . Algorithmica, 85 (5): 1111-1155 (May 2023)Group Activity Selection with Few Agent Types., , and . CoRR, (2018)Group Activity Selection with Few Agent Types., , and . ESA, volume 144 of LIPIcs, page 48:1-48:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On the Complexity Landscape of Connected f-Factor Problems., , , , and . MFCS, volume 58 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)