N. Sadagopan - RankMe

53 papers B 2Journal 45Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Bisplit graphs - A Structural and algorithmic study. CoRR Swathi D, N. Sadagopan
2025	J	`jnl`	Optimal Layout of (Kp - Cp)n into Wheel-Like Networks. J. Interconnect. Networks R. Sundara Rajan, Rini Dominic D., N. Sadagopan
2024	J	`jnl`	A closer look at Hamiltonicity and domination through the lens of diameter and convexity. Acta Informatica R. Mahendra Kumar, N. Sadagopan
2024	J	`jnl`	Embedding of Hypercube into Fractal Cubic Network. Parallel Process. Lett. R. Sundara Rajan, Remi Mariam Reji, N. Sadagopan, Ismail Naci Cangül
2024	—	`conf`	Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. CALDAM R. Mahendra Kumar, N. Sadagopan
2024	J	`jnl`	On convexity in split graphs: complexity of Steiner tree and domination. J. Comb. Optim. A. Mohanapriya, P. Renjith, N. Sadagopan
2024	B	`conf`	On the Parameterized Complexity of Minus Domination. SOFSEM Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh
2023	J	`jnl`	2-Trees: Structural insights and the study of Hamiltonian paths. Discret. Math. Algorithms Appl. P. Renjith, N. Sadagopan
2023	J	`jnl`	On 3-degree 4-chordal graphs. Discret. Math. Algorithms Appl. Devarshi Aggarwal, R. Mahendra Kumar, N. Sadagopan
2023	B	`conf`	Roman k-Domination: Hardness, Approximation and Parameterized Results. WALCOM A. Mohanapriya, P. Renjith, N. Sadagopan
2023	—	`conf`	Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. CALDAM A. Mohanapriya, P. Renjith, N. Sadagopan
2022	J	`jnl`	Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy. Int. J. Found. Comput. Sci. P. Renjith, N. Sadagopan
2022	J	`jnl`	On Convexity in Split graphs: Complexity of Steiner tree and Domination. CoRR A. Mohanapriya, P. Renjith, N. Sadagopan
2022	—	`conf`	P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. CALDAM A. Mohanapriya, P. Renjith, N. Sadagopan
2022	J	`jnl`	Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy. J. Comb. Optim. Aneesh D. H, A. Mohanapriya, P. Renjith, N. Sadagopan
2021	J	`jnl`	Hamiltonicity: Variants and Generalization in P CoRR S. Aadhavan, R. Mahendra Kumar, P. Renjith, N. Sadagopan
2021	J	`jnl`	Steiner Tree in k-star Caterpillar Convex Bipartite Graphs - A Dichotomy. CoRR Aneesh D. H, A. Mohanapriya, P. Renjith, N. Sadagopan
2020	J	`jnl`	On strictly chordality-k graphs. Discret. Appl. Math. S. Dhanalakshmi, N. Sadagopan
2020	J	`jnl`	The Steiner tree in K1, r-free split graphs - A Dichotomy. Discret. Appl. Math. P. Renjith, N. Sadagopan
2018	J	`jnl`	Hamiltonicity in Convex Bipartite Graphs. CoRR P. Kowsika, V. Divya, N. Sadagopan
2018	J	`jnl`	Listing all spanning trees in Halin graphs - sequential and Parallel view. Discret. Math. Algorithms Appl. K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan
2018	J	`jnl`	On Some Combinatorial Problems in Cographs. CoRR Kona Harshita, N. Sadagopan
2017	J	`jnl`	FO and MSO approach to Some Graph Problems: Approximation and Poly time Results. CoRR Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan
2017	J	`jnl`	Hamiltonian Path in Split Graphs- a Dichotomy. CoRR P. Renjith, N. Sadagopan
2017	—	`conf`	Hamiltonicity in Split Graphs - A Dichotomy. CALDAM P. Renjith, N. Sadagopan
2017	J	`jnl`	On P CoRR S. Aadhavan, P. Renjith, N. Sadagopan
2016	—	`conf`	Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CALDAM Madhu Illuri, P. Renjith, N. Sadagopan
2016	J	`jnl`	Constrained Hitting Set and Steiner Tree in SC CoRR S. Dhanalakshmi, N. Sadagopan
2016	J	`jnl`	Hamiltonicity in Split Graphs- a dichotomy. CoRR P. Renjith, N. Sadagopan
2016	J	`jnl`	On strictly Chordality-k graphs. CoRR S. Dhanalakshmi, N. Sadagopan
2016	J	`jnl`	R-connectivity Augmentation in Trees. CoRR S. Dhanalakshmi, N. Sadagopan, Nitin Vivek Bharti
2016	J	`jnl`	Spanning Trees in 2-trees. CoRR P. Renjith, N. Sadagopan, Douglas B. West
2016	J	`jnl`	Tri-connectivity Augmentation in Trees. CoRR S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar
2016	J	`jnl`	Tri-connectivity Augmentation in Trees. Electron. Notes Discret. Math. S. Dhanalakshmi, N. Sadagopan, V. Manogna
2015	J	`jnl`	Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CoRR Madhu Illuri, P. Renjith, N. Sadagopan
2015	J	`jnl`	Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. N. S. Narayanaswamy, N. Sadagopan
2015	J	`jnl`	Hamiltonian Path in 2-Trees. CoRR P. Renjith, N. Sadagopan
2015	J	`jnl`	Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view. CoRR K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan
2015	J	`jnl`	Simpler Sequential and Parallel Biconnectivity Augmentation in Trees. Parallel Process. Lett. Surabhi Jain, N. Sadagopan
2014	J	`jnl`	Some Combinatorial Problems on Halin Graphs. CoRR M. Kavin, K. Keerthana, N. Sadagopan, Sangeetha S, R. Vinothini
2014	J	`jnl`	Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective. CoRR Vandhana C., S. Hima Bindhu, P. Renjith, N. Sadagopan, B. Supraja
2013	J	`jnl`	A Dirac-type characterization of Discret. Math. R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2013	J	`jnl`	A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. N. S. Narayanaswamy, N. Sadagopan
2013	J	`jnl`	Domain Specific Hierarchical Huffman Encoding. CoRR K. Ilambharathi, G. S. N. V. Venkata Manik, N. Sadagopan, B. Sivaselvan
2013	J	`jnl`	Simpler Sequential and Parallel Biconnectivity Augmentation. CoRR Surabhi Jain, N. Sadagopan
2012	J	`jnl`	A Dirac-type Characterization of k-chordal Graphs CoRR R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan
2011	J	`jnl`	A Characterization of all Stable Minimal Separator Graphs CoRR Mrinal Kumar, Gaurav Maheshwari, N. Sadagopan
2011	—	`conf`	A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS N. S. Narayanaswamy, N. Sadagopan
2011	J	`jnl`	On the Complexity of Connected (s, t)-Vertex Separator CoRR N. S. Narayanaswamy, N. Sadagopan
2010	J	`jnl`	Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan
2009	J	`jnl`	A Note on Contractible Edges in Chordal Graphs CoRR N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey
2009	J	`jnl`	On the Structure of Contractible Edges in Graphs Comb. N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran
2009	J	`jnl`	On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electron. Notes Discret. Math. N. S. Narayanaswamy, N. Sadagopan