A Note on Contractible Edges in Chordal Graphs - N. S. Narayanaswamy; N. Sadagopan; Apoorve Dubey (CoRR, 2009)

On the Structure of Contractible Vertex Pairs in Chordal Graphs. - N. S. Narayanaswamy; N. Sadagopan (Electron. Notes Discret. Math., 2009)

On the Structure of Contractible Edges in k-connected Partial k-trees. - N. S. Narayanaswamy; N. Sadagopan; L. Sunil Chandran (Graphs Comb., 2009)

Non-contractible non-edges in 2-connected graphs. - Anita Das 001; Mathew C. Francis; Rogers Mathew; N. Sadagopan (Inf. Process. Lett., 2010)

A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. - N. S. Narayanaswamy; N. Sadagopan (CATS, 2011)

A Characterization of all Stable Minimal Separator Graphs - Mrinal Kumar 001; Gaurav Maheshwari 002; N. Sadagopan (CoRR, 2011)

On the Complexity of Connected (s, t)-Vertex Separator - N. S. Narayanaswamy; N. Sadagopan (CoRR, 2011)

A Dirac-type Characterization of k-chordal Graphs - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (CoRR, 2012)

Domain Specific Hierarchical Huffman Encoding. - K. Ilambharathi; G. S. N. V. Venkata Manik; N. Sadagopan; B. Sivaselvan (CoRR, 2013)

Simpler Sequential and Parallel Biconnectivity Augmentation. - Surabhi Jain; N. Sadagopan (CoRR, 2013)

A Dirac-type characterization of k-chordal graphs. - R. Krithika 001; Rogers Mathew; N. S. Narayanaswamy; N. Sadagopan (Discret. Math., 2013)

A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. - N. S. Narayanaswamy; N. Sadagopan (Int. J. Found. Comput. Sci., 2013)

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

Some Combinatorial Problems on Halin Graphs. - M. Kavin; K. Keerthana; N. Sadagopan; Sangeetha S; R. Vinothini (CoRR, 2014)

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

Connected (s, t)-Vertex Separator Parameterized by Chordality. - N. S. Narayanaswamy; N. Sadagopan (J. Graph Algorithms Appl., 2015)

Simpler Sequential and Parallel Biconnectivity Augmentation in Trees. - Surabhi Jain; N. Sadagopan (Parallel Process. Lett., 2015)

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

Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs. - S. Dhanalakshmi; N. Sadagopan (CoRR, 2016)

R-connectivity Augmentation in Trees. - S. Dhanalakshmi; N. Sadagopan; Nitin Vivek Bharti (CoRR, 2016)

Tri-connectivity Augmentation in Trees. - S. Dhanalakshmi; N. Sadagopan; D. Sunil Kumar (CoRR, 2016)

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

Tri-connectivity Augmentation in Trees. - S. Dhanalakshmi; N. Sadagopan; V. Manogna (Electron. Notes Discret. Math., 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)

On Some Combinatorial Problems in Cographs. - Kona Harshita; N. Sadagopan (CoRR, 2018)

Hamiltonicity in Convex Bipartite Graphs. - P. Kowsika; V. Divya; N. Sadagopan (CoRR, 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)

On strictly chordality-k graphs. - S. Dhanalakshmi; N. Sadagopan (Discret. Appl. Math., 2020)

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)

On 3-degree 4-chordal graphs. - Devarshi Aggarwal; R. Mahendra Kumar; N. Sadagopan (Discret. Math. Algorithms Appl., 2023)

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

Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. - R. Mahendra Kumar; N. Sadagopan (CALDAM, 2024)

On the Parameterized Complexity of Minus Domination. - Sriram Bhyravarapu; Lawqueen Kanesh; A. Mohanapriya; Nidhi Purohit; N. Sadagopan; Saket Saurabh 001 (SOFSEM, 2024)

Embedding of Hypercube into Fractal Cubic Network. - R. Sundara Rajan; Remi Mariam Reji; N. Sadagopan; Ismail Naci Cangül (Parallel Process. Lett., 2024)

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

A closer look at Hamiltonicity and domination through the lens of diameter and convexity. - R. Mahendra Kumar; N. Sadagopan (Acta Informatica, 2024)

Optimal Layout of (Kp - Cp)n into Wheel-Like Networks. - R. Sundara Rajan; Rini Dominic D.; N. Sadagopan (J. Interconnect. Networks, 2025)