N. Sadagopan

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 30

Top Topics

Bipartite Graph

Hamiltonian Path

Top Venues

Discret. Math. Algorithms Appl.

J. Comb. Optim.

Publications

R. Mahendra Kumar, N. Sadagopan
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. CALDAM (2024)
A. Mohanapriya, P. Renjith, N. Sadagopan
On convexity in split graphs: complexity of Steiner tree and domination. J. Comb. Optim. 47 (2) (2024)
Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
On the Parameterized Complexity of Minus Domination. SOFSEM (2024)
Devarshi Aggarwal, R. Mahendra Kumar, N. Sadagopan
On 3-degree 4-chordal graphs. Discret. Math. Algorithms Appl. 15 (1) (2023)
P. Renjith, N. Sadagopan
2-Trees: Structural insights and the study of Hamiltonian paths. Discret. Math. Algorithms Appl. 15 (4) (2023)
A. Mohanapriya, P. Renjith, N. Sadagopan
Roman k-Domination: Hardness, Approximation and Parameterized Results. WALCOM (2023)
A. Mohanapriya, P. Renjith, N. Sadagopan
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. CALDAM (2023)
P. Renjith, N. Sadagopan
Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy. Int. J. Found. Comput. Sci. 33 (1) (2022)
A. Mohanapriya, P. Renjith, N. Sadagopan
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. CALDAM (2022)
Aneesh D. H, A. Mohanapriya, P. Renjith, N. Sadagopan
Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. J. Comb. Optim. 44 (2) (2022)
A. Mohanapriya, P. Renjith, N. Sadagopan
On Convexity in Split graphs: Complexity of Steiner tree and Domination. CoRR (2022)
S. Aadhavan, R. Mahendra Kumar, P. Renjith, N. Sadagopan
-free Chordal Bipartite graphs. CoRR (2021)
Aneesh D. H, A. Mohanapriya, P. Renjith, N. Sadagopan
Steiner Tree in k-star Caterpillar Convex Bipartite Graphs - A Dichotomy. CoRR (2021)
P. Renjith, N. Sadagopan
The Steiner tree in K1, r-free split graphs - A Dichotomy. Discret. Appl. Math. 280 (2020)
S. Dhanalakshmi, N. Sadagopan
On strictly chordality-k graphs. Discret. Appl. Math. 280 (2020)
K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan
Listing all spanning trees in Halin graphs - sequential and Parallel view. Discret. Math. Algorithms Appl. 10 (1) (2018)
Kona Harshita, N. Sadagopan
On Some Combinatorial Problems in Cographs. CoRR (2018)
P. Kowsika, V. Divya, N. Sadagopan
Hamiltonicity in Convex Bipartite Graphs. CoRR (2018)
Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results. CoRR (2017)
P. Renjith, N. Sadagopan
Hamiltonian Path in Split Graphs- a Dichotomy. CoRR (2017)
P. Renjith, N. Sadagopan
Hamiltonicity in Split Graphs - A Dichotomy. CALDAM (2017)
S. Aadhavan, P. Renjith, N. Sadagopan
-free Chordal bipartite graphs. CoRR (2017)
S. Dhanalakshmi, N. Sadagopan, Nitin Vivek Bharti
R-connectivity Augmentation in Trees. CoRR (2016)
S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar
Tri-connectivity Augmentation in Trees. CoRR (2016)
P. Renjith, N. Sadagopan
Hamiltonicity in Split Graphs- a dichotomy. CoRR (2016)
Madhu Illuri, P. Renjith, N. Sadagopan
Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CALDAM (2016)
P. Renjith, N. Sadagopan, Douglas B. West
Spanning Trees in 2-trees. CoRR (2016)
S. Dhanalakshmi, N. Sadagopan
-free Graphs. CoRR (2016)
S. Dhanalakshmi, N. Sadagopan, V. Manogna
Tri-connectivity Augmentation in Trees. Electron. Notes Discret. Math. 53 (2016)
S. Dhanalakshmi, N. Sadagopan
On strictly Chordality-k graphs. CoRR (2016)
Surabhi Jain, N. Sadagopan
Simpler Sequential and Parallel Biconnectivity Augmentation in Trees. Parallel Process. Lett. 25 (4) (2015)
K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan
Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view. CoRR (2015)
P. Renjith, N. Sadagopan
Hamiltonian Path in 2-Trees. CoRR (2015)
Madhu Illuri, P. Renjith, N. Sadagopan
Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CoRR (2015)
N. S. Narayanaswamy, N. Sadagopan
Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. 19 (1) (2015)
M. Kavin, K. Keerthana, N. Sadagopan, Sangeetha. S, R. Vinothini
Some Combinatorial Problems on Halin Graphs. CoRR (2014)
Vandhana C., S. Hima Bindhu, P. Renjith, N. Sadagopan, B. Supraja
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective. CoRR (2014)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
-chordal graphs. Discret. Math. 313 (24) (2013)
N. S. Narayanaswamy, N. Sadagopan
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. 24 (1) (2013)
K. Ilambharathi, G. S. N. V. Venkata Manik, N. Sadagopan, B. Sivaselvan
Domain Specific Hierarchical Huffman Encoding. CoRR (2013)
Surabhi Jain, N. Sadagopan
Simpler Sequential and Parallel Biconnectivity Augmentation. CoRR (2013)
R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
A Dirac-type Characterization of k-chordal Graphs CoRR (2012)
Mrinal Kumar, Gaurav Maheshwari, N. Sadagopan
A Characterization of all Stable Minimal Separator Graphs CoRR (2011)
N. S. Narayanaswamy, N. Sadagopan
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS (2011)
N. S. Narayanaswamy, N. Sadagopan
On the Complexity of Connected (s, t)-Vertex Separator CoRR (2011)
Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan
Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. 110 (23) (2010)
N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran
-trees. Graphs Comb. 25 (4) (2009)
N. S. Narayanaswamy, N. Sadagopan
On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electron. Notes Discret. Math. 33 (2009)
N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey
A Note on Contractible Edges in Chordal Graphs CoRR (2009)