| An Efficient Overflow Handling Technique for Histogram Shifting based Reversible Data Hiding VM Manikandan, P Renjith 2020 International Conference on Innovative Trends in Information Technology …, 2020 | 13 | 2020 |
| The Steiner tree in K1, r-free split graphs—A Dichotomy P Renjith, N Sadagopan Discrete Applied Mathematics 280, 246-255, 2020 | 12 | 2020 |
| Hamiltonicity in split graphs-a dichotomy P Renjith, N Sadagopan Algorithms and Discrete Applied Mathematics: Third International Conference …, 2017 | 7 | 2017 |
| Complexity of steiner tree in split graphs-dichotomy results M Illuri, P Renjith, N Sadagopan Conference on Algorithms and Discrete Applied Mathematics, 308-325, 2016 | 7 | 2016 |
| Verifiable El-gamal re-encryption with authenticity in cloud P Renjith, S Sabitha 2013 Fourth International Conference on Computing, Communications and …, 2013 | 7 | 2013 |
| Hamiltonian Cycle in -Free Split Graphs — A Dichotomy P Renjith, N Sadagopan International Journal of Foundations of Computer Science 33 (01), 1-32, 2022 | 3 | 2022 |
| Steiner Tree in -star Caterpillar Convex Bipartite Graphs -- A Dichotomy A Mohanapriya, P Renjith, N Sadagopan arXiv preprint arXiv:2107.09382, 2021 | 3 | 2021 |
| Hamiltonian path in split graphs-a dichotomy P Renjith, N Sadagopan arXiv preprint arXiv:1711.09262, 2017 | 3 | 2017 |
| Survey on Data Sharing and Re-Encryption in Cloud P Renjith, S Sabitha International Journal of Advanced Research in Computer Engineering …, 2013 | 3 | 2013 |
| Hamiltonicity: Variants and Generalization in -free Chordal Bipartite graphs S Aadhavan, RM Kumar, P Renjith, N Sadagopan arXiv preprint arXiv:2107.04798, 2021 | 2 | 2021 |
| Hamiltonian Path in -free Split Graphs- A Dichotomy P Renjith, N Sadagopan Conference on Algorithms and Discrete Applied Mathematics, 30-44, 2018 | 2 | 2018 |
| 2-Trees: Structural insights and the study of Hamiltonian paths P Renjith, N Sadagopan Discrete Mathematics, Algorithms and Applications 15 (04), 2250113, 2023 | 1 | 2023 |
| P Versus NPC: Minimum Steiner Trees in Convex Split Graphs A Mohanapriya, P Renjith, N Sadagopan Conference on Algorithms and Discrete Applied Mathematics, 115-126, 2022 | 1 | 2022 |
| Listing all spanning trees in Halin graphs—sequential and Parallel view KKM Reddy, P Renjith, N Sadagopan Discrete Mathematics, Algorithms and Applications 10 (01), 1850005, 2018 | 1 | 2018 |
| On convexity in split graphs: complexity of Steiner tree and domination A Mohanapriya, P Renjith, N Sadagopan Journal of Combinatorial Optimization 47 (2), 8, 2024 | | 2024 |
| Roman k-Domination: Hardness, Approximation and Parameterized Results A Mohanapriya, P Renjith, N Sadagopan International Conference and Workshops on Algorithms and Computation, 343-355, 2023 | | 2023 |
| Domination and its variants in split graphs-P versus NPC dichotomy A Mohanapriya, P Renjith, N Sadagopan The Journal of Analysis 31 (1), 353-364, 2023 | | 2023 |
| Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs A Mohanapriya, P Renjith, N Sadagopan Conference on Algorithms and Discrete Applied Mathematics, 219-230, 2023 | | 2023 |
| On Convexity in Split graphs: Complexity of Steiner tree and Domination A Mohanapriya, P Renjith, N Sadagopan arXiv preprint arXiv:2210.02288, 2022 | | 2022 |
| Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy DH Aneesh, A Mohanapriya, P Renjith, N Sadagopan Journal of Combinatorial Optimization 44 (2), 1221-1247, 2022 | | 2022 |
Sabitha SProfessorVerified email at cet.ac.in
