Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective. - Vandhana C.; S. Hima Bindhu; P. Renjith; N. Sadagopan; B. Supraja (CoRR, 2014)

Hamiltonian Path in 2-Trees. - P. Renjith; N. Sadagopan (CoRR, 2015)

Complexity of Steiner Tree in Split Graphs - Dichotomy Results. - Madhu Illuri; P. Renjith; N. Sadagopan (CALDAM, 2016)

Spanning Trees in 2-trees. - P. Renjith; N. Sadagopan; Douglas B. West (CoRR, 2016)

Hamiltonicity in Split Graphs - A Dichotomy. - P. Renjith; N. Sadagopan (CALDAM, 2017)

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results. - Kona Harshita; Sounaka Mishra; P. Renjith; N. Sadagopan (CoRR, 2017)

On P5-free Chordal bipartite graphs. - S. Aadhavan; P. Renjith; N. Sadagopan (CoRR, 2017)

Hamiltonian Path in Split Graphs- a Dichotomy. - P. Renjith; N. Sadagopan (CoRR, 2017)

Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy. - Pazhaniappan Renjith; Narasimhan Sadagopan (CALDAM, 2018)

Listing all spanning trees in Halin graphs - sequential and Parallel view. - K. Krishna Mohan Reddy; P. Renjith; N. Sadagopan (Discret. Math. Algorithms Appl., 2018)

The Steiner tree in K1, r-free split graphs - A Dichotomy. - P. Renjith; N. Sadagopan (Discret. Appl. Math., 2020)

Hamiltonicity: Variants and Generalization in P5-free Chordal Bipartite graphs. - S. Aadhavan; R. Mahendra Kumar; P. Renjith; N. Sadagopan (CoRR, 2021)

P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. - A. Mohanapriya; P. Renjith; N. Sadagopan (CALDAM, 2022)

Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy. - P. Renjith; N. Sadagopan (Int. J. Found. Comput. Sci., 2022)

Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. - Aneesh D. H; A. Mohanapriya; P. Renjith; N. Sadagopan (J. Comb. Optim., 2022)

Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. - A. Mohanapriya; P. Renjith; N. Sadagopan (CALDAM, 2023)

Roman k-Domination: Hardness, Approximation and Parameterized Results. - A. Mohanapriya; P. Renjith; N. Sadagopan (WALCOM, 2023)

2-Trees: Structural insights and the study of Hamiltonian paths. - P. Renjith; N. Sadagopan (Discret. Math. Algorithms Appl., 2023)

On convexity in split graphs: complexity of Steiner tree and domination. - A. Mohanapriya; P. Renjith; N. Sadagopan (J. Comb. Optim., 2024)