| Design possibilities and challenges of DNN models: a review on the perspective of end devices H Hussain, PS Tamizharasan, CS Rahul Artificial Intelligence Review, 1-59, 2022 | 22 | 2022 |
| Approximability of connected factors K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, CS Rahul Approximation and Online Algorithms: 11th International Workshop, WAOA 2013 …, 2014 | 10 | 2014 |
| Group Activity Selection with Few Agent Types R Ganian, S Ordyniak, R C. S. 27th Annual European Symposium on Algorithms 48, 48:1– 48:16, 2019 | 8 | 2019 |
| Approximation algorithms for connected graph factors of minimum weight K Cornelissen, R Hoeksma, B Manthey, NS Narayanaswamy, C S. Rahul, ... Theory of Computing Systems 62, 441-464, 2018 | 6 | 2018 |
| Graph homomorphism polynomials: Algorithms and complexity B Komarath, A Pandey, CS Rahul arXiv preprint arXiv:2011.04778, 2020 | 5 | 2020 |
| Approximation and Exact Algorithms for Special Cases of Connected f-Factors NS Narayanaswamy, CS Rahul Computer Science--Theory and Applications: 10th International Computer …, 2015 | 4 | 2015 |
| Monotone arithmetic complexity of graph homomorphism polynomials B Komarath, A Pandey, CS Rahul Algorithmica 85 (9), 2554-2579, 2023 | 2 | 2023 |
| Group activity selection with few agent types R Ganian, S Ordyniak, CS Rahul Algorithmica 85 (5), 1111-1155, 2023 | 2 | 2023 |
| On the Complexity Landscape of Connected f-Factor Problems R Ganian, NS Narayanaswamy, S Ordyniak, CS Rahul, MS Ramanujan Algorithmica 81, 2606-2632, 2019 | | 2019 |
| A Characterization for the Existence of Connected -Factors of Minimum Degree NS Narayanaswamy, CS Rahul arXiv preprint arXiv:1601.06291, 2016 | | 2016 |
| A Classification of Connected f-factor Problems inside NP NS Narayanaswamy, CS Rahul arXiv preprint arXiv:1507.07856, 2015 | | 2015 |
| DESIGN OF AN SMS LEXICON FOR AN INDIAN R CS INDIAN INSTITUTE OF TECHNOLOGY MADRAS, 2010 | | 2010 |
