DEPARTMENTS
Renjith P.
Renjith P.

Assistant Professor

Office Address:

CSE 202A

Contact no:

+91-495-228-6846

Email ID:

renjith@nitc.ac.in

Home Address:

  • Ph.D. Indian Institute of Information Technology Design and Manufacturing Kancheepuram, Chennai, India. (Thesis: On Spanning trees- Constraints, Variants and Generalizations (Theory, Algorithm and Dichotomy))

  • M.Tech (Computer Science and Engineering), College of Engineering Trivandrum, Kerala

  • B.Tech (Computer Science and Engineering), College of Engineering Perumon (CUSAT), Kerala

  • Educational Qualifications

    • Ph.D. Indian Institute of Information Technology Design and Manufacturing Kancheepuram, Chennai, India. (Thesis: On Spanning trees- Constraints, Variants and Generalizations (Theory, Algorithm and Dichotomy))

    • M.Tech (Computer Science and Engineering), College of Engineering Trivandrum, Kerala

    • B.Tech (Computer Science and Engineering), College of Engineering Perumon (CUSAT), Kerala

    Journals

    2024

    A Mohanapriya, P Renjith, N Sadagopan, On convexity in split graphs: complexity of Steiner tree and dominatio, Journal of Combinatorial Optimization 47 (2), 8

    2023

    P Renjith, N Sadagopan, 2-Trees: Structural insights and the study of Hamiltonian paths, Discrete Mathematics, Algorithms and Applications 15 (04), 2250113

    A Mohanapriya, P Renjith, N Sadagopan, Domination and its variants in split graphs-P versus NPC dichotomy, The Journal of Analysis 31 (1), 353-364
     
    A Mohanapriya, P Renjith, N Sadagopan, Roman k-Domination: Hardness, Approximation and Parameterized Results, International Conference and Workshops on Algorithms and Computation, 343-355
     
    A Mohanapriya, P Renjith, N Sadagopan, Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs, Conference on Algorithms and Discrete Applied Mathematics, 219-230
     

    2022

    P Renjith, N Sadagopan, Hamiltonian Cycle in -Free Split Graphs — A Dichotomy,International Journal of Foundations of Computer Science 33 (01), 1-32

    A Mohanapriya, P Renjith, N Sadagopan, P Versus NPC: Minimum Steiner Trees in Convex Split Graphs, Conference on Algorithms and Discrete Applied Mathematics, 115-126
     
    A Mohanapriya, P Renjith, N Sadagopan, On Convexity in Split graphs: Complexity of Steiner tree and Domination, arXiv preprint arXiv:2210.02288
     
    DH Aneesh, A Mohanapriya, P Renjith, N Sadagopan, Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy, Journal of Combinatorial Optimization 44 (2), 1221-1247
     

    2021

    A Mohanapriya, P Renjith, N Sadagopan, Steiner Tree in -star Caterpillar Convex Bipartite Graphs -- A Dichotomy, arXiv preprint arXiv:2107.09382
     
    S Aadhavan, RM Kumar, P Renjith, N Sadagopan, Hamiltonicity: Variants and Generalization in -free Chordal Bipartite graphs, arXiv preprint arXiv:2107.04798
     

    2020

    P Renjith, N Sadagopan, The Steiner tree in K1, r-free split graphs—A Dichotomy, Discrete Applied Mathematics 280, 246-255

    VM Manikandan, P Renjith, An Efficient Overflow Handling Technique for Histogram Shifting based Reversible Data Hiding, 2020 International Conference on Innovative Trends in Information Technology 
     
    A Mohanapriya, CV Praveena, P Renjith, N Sadagopan, Some Classical Problems on K1,3-free Split Graphs., 2020 IEEE 4th Conference on Information & Communication Technology (CICT), 1-11
     

    2018

    P Renjith, N Sadagopan, Hamiltonian Path in -free Split Graphs- A Dichotomy,Conference on Algorithms and Discrete Applied Mathematics, 30-44
     
    KKM Reddy, P Renjith, N Sadagopan, Listing all spanning trees in Halin graphs—sequential and Parallel view, Discrete Mathematics, Algorithms and Applications 10 (01), 1850005
     

    2017

    P Renjith, N Sadagopan, Hamiltonicity in split graphs-a dichotomy, Algorithms and Discrete Applied Mathematics: Third International Conference …
     
    P Renjith, N Sadagopan, Hamiltonian path in split graphs-a dichotomy, arXiv preprint arXiv:1711.09262
     
    S Aadhavan, P Renjith, N Sadagopan, On -free Chordal bipartite graphs, arXiv preprint arXiv:1711.07736
     

    2016

    M Illuri, P Renjith, N Sadagopan, Complexity of steiner tree in split graphs-dichotomy results,Conference on Algorithms and Discrete Applied Mathematics, 308-325
     
    P Renjith, N Sadagopan, Hamiltonicity in Split Graphs-a dichotomy, arXiv preprint arXiv:1610.00855
     
    P Renjith, N Sadagopan, DB West, Spanning Trees in 2-trees, arXiv preprint arXiv:1607.05817
     

    2015

    K Krishna Mohan Reddy, P Renjith, N Sadagopan, Listing All Spanning Trees in Halin Graphs-Sequential and Parallel view, arXiv e-prints, arXiv: 1511.01696
     
    P Renjith, N Sadagopan, Hamiltonian Path in 2-Trees., arXiv preprint arXiv:1511.02038
     

    2014

    SH Bindhu, P Renjith, N Sadagopan, B Supraja, Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective, arXiv preprint arXiv:1408.3977
     
    S Hima Bindhu, P Renjith, N Sadagopan, B Supraja, Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective, arXiv e-prints, arXiv: 1408.3977
     

    2013

    P Renjith, S Sabitha, Verifiable El-gamal re-encryption with authenticity in cloud, 2013 Fourth International Conference on Computing, Communications and …
     
    P Renjith, S Sabitha, Survey on Data Sharing and Re-Encryption in Cloud, International Journal of Advanced Research in Computer Engineering …
     

    Professional Experience

    • Asst. Professor, Indian Institute of Information Technology Design and Manufacturing Kurnool, Andhra Pradesh. ( 2019- 2022)

    • Asst. Professor, Indian Institute of Information Technology Kottayam, Kerala. ( 2018- 2019)

    • Asst. Professor, Heera College of Engineering and Technology (HCET), Trivandrum, Kerala. (2013)

    Google Scholar

    DBLP

    Graph Theory and Graph Algorithms

    GATE 2013

    B.Tech Gold Medalist (Co-operative Academy for Professional Education (CAPE), Kerala), 2010

    RMS Lifetime Member, Membership ID: RMS 1682