default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDN. Sadagopan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]R. Mahendra Kumar, N. Sadagopan:
A closer look at Hamiltonicity and domination through the lens of diameter and convexity. Acta Informatica 61(4): 357-382 (2024)- [j16]A. Mohanapriya
, P. Renjith, N. Sadagopan:
On convexity in split graphs: complexity of Steiner tree and domination. J. Comb. Optim. 47(2): 8 (2024) - [c9]R. Mahendra Kumar, N. Sadagopan:
Impact of Diameter and Convex Ordering for Hamiltonicity and Domination. CALDAM 2024: 194-208 - [c8]Sriram Bhyravarapu, Lawqueen Kanesh, A. Mohanapriya, Nidhi Purohit, N. Sadagopan, Saket Saurabh:
On the Parameterized Complexity of Minus Domination. SOFSEM 2024: 96-110 - 2023
- [j15]Devarshi Aggarwal, R. Mahendra Kumar, N. Sadagopan:
On 3-degree 4-chordal graphs. Discret. Math. Algorithms Appl. 15(1): 2250053:1-2250053:23 (2023) - [j14]P. Renjith, N. Sadagopan:
2-Trees: Structural insights and the study of Hamiltonian paths. Discret. Math. Algorithms Appl. 15(4): 2250113:1-2250113:24 (2023) - [c7]A. Mohanapriya, P. Renjith, N. Sadagopan:
Short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs. CALDAM 2023: 219-230 - [c6]A. Mohanapriya, P. Renjith, N. Sadagopan:
Roman k-Domination: Hardness, Approximation and Parameterized Results. WALCOM 2023: 343-355 - 2022
- [j13]P. Renjith, N. Sadagopan:
Hamiltonian Cycle in K1, r-Free Split Graphs - A Dichotomy. Int. J. Found. Comput. Sci. 33(1): 1-32 (2022) - [j12]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): 1221-1247 (2022) - [c5]A. Mohanapriya, P. Renjith, N. Sadagopan:
P Versus NPC: Minimum Steiner Trees in Convex Split Graphs. CALDAM 2022: 115-126 - [i25]A. Mohanapriya, P. Renjith, N. Sadagopan:
On Convexity in Split graphs: Complexity of Steiner tree and Domination. CoRR abs/2210.02288 (2022) - 2021
- [i24]S. Aadhavan, R. Mahendra Kumar, P. Renjith, N. Sadagopan:
Hamiltonicity: Variants and Generalization in P5-free Chordal Bipartite graphs. CoRR abs/2107.04798 (2021) - [i23]Aneesh D. H, A. Mohanapriya, P. Renjith, N. Sadagopan:
Steiner Tree in k-star Caterpillar Convex Bipartite Graphs - A Dichotomy. CoRR abs/2107.09382 (2021) - 2020
- [j11]S. Dhanalakshmi, N. Sadagopan:
On strictly chordality-k graphs. Discret. Appl. Math. 280: 93-112 (2020) - [j10]P. Renjith, N. Sadagopan:
The Steiner tree in K1, r-free split graphs - A Dichotomy. Discret. Appl. Math. 280: 246-255 (2020)
2010 – 2019
- 2018
- [j9]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): 1850005:1-1850005:17 (2018) - [c4]Pazhaniappan Renjith, Narasimhan Sadagopan:
Hamiltonian Path in K_1, t -free Split Graphs- A Dichotomy. CALDAM 2018: 30-44 - [i22]Kona Harshita, N. Sadagopan:
On Some Combinatorial Problems in Cographs. CoRR abs/1808.09117 (2018) - [i21]P. Kowsika, V. Divya, N. Sadagopan:
Hamiltonicity in Convex Bipartite Graphs. CoRR abs/1809.06113 (2018) - 2017
- [c3]P. Renjith, N. Sadagopan:
Hamiltonicity in Split Graphs - A Dichotomy. CALDAM 2017: 320-331 - [i20]Kona Harshita, Sounaka Mishra, P. Renjith, N. Sadagopan:
FO and MSO approach to Some Graph Problems: Approximation and Poly time Results. CoRR abs/1711.02889 (2017) - [i19]S. Aadhavan, P. Renjith, N. Sadagopan:
On P5-free Chordal bipartite graphs. CoRR abs/1711.07736 (2017) - [i18]P. Renjith, N. Sadagopan:
Hamiltonian Path in Split Graphs- a Dichotomy. CoRR abs/1711.09262 (2017) - 2016
- [j8]S. Dhanalakshmi, N. Sadagopan, V. Manogna:
Tri-connectivity Augmentation in Trees. Electron. Notes Discret. Math. 53: 57-72 (2016) - [c2]Madhu Illuri, P. Renjith, N. Sadagopan:
Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CALDAM 2016: 308-325 - [i17]S. Dhanalakshmi, N. Sadagopan, D. Sunil Kumar:
Tri-connectivity Augmentation in Trees. CoRR abs/1601.00506 (2016) - [i16]S. Dhanalakshmi, N. Sadagopan:
On strictly Chordality-k graphs. CoRR abs/1606.00359 (2016) - [i15]P. Renjith, N. Sadagopan, Douglas B. West:
Spanning Trees in 2-trees. CoRR abs/1607.05817 (2016) - [i14]S. Dhanalakshmi, N. Sadagopan, Nitin Vivek Bharti:
R-connectivity Augmentation in Trees. CoRR abs/1608.01971 (2016) - [i13]S. Dhanalakshmi, N. Sadagopan:
Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs. CoRR abs/1610.00853 (2016) - [i12]P. Renjith, N. Sadagopan:
Hamiltonicity in Split Graphs- a dichotomy. CoRR abs/1610.00855 (2016) - 2015
- [j7]N. S. Narayanaswamy, N. Sadagopan:
Connected (s, t)-Vertex Separator Parameterized by Chordality. J. Graph Algorithms Appl. 19(1): 549-565 (2015) - [j6]Surabhi Jain, N. Sadagopan:
Simpler Sequential and Parallel Biconnectivity Augmentation in Trees. Parallel Process. Lett. 25(4): 1550010:1-1550010:15 (2015) - [i11]Madhu Illuri, P. Renjith, N. Sadagopan:
Complexity of Steiner Tree in Split Graphs - Dichotomy Results. CoRR abs/1511.01668 (2015) - [i10]K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan:
Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view. CoRR abs/1511.01696 (2015) - [i9]P. Renjith, N. Sadagopan:
Hamiltonian Path in 2-Trees. CoRR abs/1511.02038 (2015) - 2014
- [i8]Vandhana C., S. Hima Bindhu, P. Renjith, N. Sadagopan, B. Supraja:
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective. CoRR abs/1408.3977 (2014) - [i7]M. Kavin, K. Keerthana, N. Sadagopan, Sangeetha S, R. Vinothini:
Some Combinatorial Problems on Halin Graphs. CoRR abs/1410.6621 (2014) - 2013
- [j5]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type characterization of k-chordal graphs. Discret. Math. 313(24): 2865-2867 (2013) - [j4]N. S. Narayanaswamy, N. Sadagopan:
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation. Int. J. Found. Comput. Sci. 24(1): 67-94 (2013) - [i6]K. Ilambharathi, G. S. N. V. Venkata Manik, N. Sadagopan, B. Sivaselvan:
Domain Specific Hierarchical Huffman Encoding. CoRR abs/1307.0920 (2013) - [i5]Surabhi Jain, N. Sadagopan:
Simpler Sequential and Parallel Biconnectivity Augmentation. CoRR abs/1307.1772 (2013) - 2012
- [i4]R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type Characterization of k-chordal Graphs. CoRR abs/1206.5397 (2012) - 2011
- [c1]N. S. Narayanaswamy, N. Sadagopan:
A Novel Data Structure for Biconnectivity, Triconnectivity, and k-Tree Augmentation. CATS 2011: 45-54 - [i3]Mrinal Kumar, Gaurav Maheshwari, N. Sadagopan:
A Characterization of all Stable Minimal Separator Graphs. CoRR abs/1103.2913 (2011) - [i2]N. S. Narayanaswamy, N. Sadagopan:
On the Complexity of Connected (s, t)-Vertex Separator. CoRR abs/1111.1814 (2011) - 2010
- [j3]Anita Das, Mathew C. Francis, Rogers Mathew, N. Sadagopan:
Non-contractible non-edges in 2-connected graphs. Inf. Process. Lett. 110(23): 1044-1048 (2010)
2000 – 2009
- 2009
- [j2]N. S. Narayanaswamy, N. Sadagopan:
On the Structure of Contractible Vertex Pairs in Chordal Graphs. Electron. Notes Discret. Math. 33: 29-36 (2009) - [j1]N. S. Narayanaswamy, N. Sadagopan, L. Sunil Chandran:
On the Structure of Contractible Edges in k-connected Partial k-trees. Graphs Comb. 25(4): 557-569 (2009) - [i1]N. S. Narayanaswamy, N. Sadagopan, Apoorve Dubey:
A Note on Contractible Edges in Chordal Graphs. CoRR abs/0902.1364 (2009)
Coauthor Index
aka: Pazhaniappan Renjith
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
