default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDN. Parthiban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Debajyoti Mondal
, N. Parthiban, Indra Rajasingh:
On the oriented diameter of planar triangulations. J. Comb. Optim. 47(5): 79 (2024)- 2022
- [j14]Gautam Srivastava, Muneeswari S, Revathi Venkataraman, V. Kavitha, N. Parthiban:
A review of the state of the art in business intelligence software. Enterp. Inf. Syst. 16(1): 1-28 (2022) - [j13]Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, Indra Rajasingh:
APX-hardness and approximation for the k-burning number problem. Theor. Comput. Sci. 932: 21-30 (2022) - [c6]Debajyoti Mondal, N. Parthiban, Indra Rajasingh:
Bounds for the Oriented Diameter of Planar Triangulations. FAW 2022: 192-205 - [i3]Debajyoti Mondal, N. Parthiban, Indra Rajasingh:
Oriented Diameter of Planar Triangulations. CoRR abs/2203.04253 (2022) - 2021
- [j12]R. Stalin Mary, N. Parthiban, Indra Rajasingh, Paul D. Manuel:
Optimal layout of recursive circulant graphs. Int. J. Comput. Math. Comput. Syst. Theory 6(3): 209-219 (2021) - [c5]K. Sornalakshmi, Revathi Venkataraman, N. Parthiban, V. Kavitha:
IoT based Circadian Rhythm Monitoring using Fuzzy Logic. IoTBDS 2021: 223-228 - [c4]Venkatesh K. Pappakrishnan, R. Mythili, V. Kavitha, N. Parthiban:
Role of Artificial Intelligence of Things (AIoT) in Covid-19 Pandemic: A Brief Survey. IoTBDS 2021: 229-236 - [c3]Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh:
APX-Hardness and Approximation for the k-Burning Number Problem. WALCOM 2021: 272-283 - 2020
- [j11]Gautam Srivastava, C. N. S. Vinoth Kumar, V. Kavitha, N. Parthiban, Revathi Venkataraman:
Two-stage data encryption using chaotic neural networks. J. Intell. Fuzzy Syst. 38(3): 2561-2568 (2020) - [i2]Debajyoti Mondal, N. Parthiban, V. Kavitha, Indra Rajasingh:
APX-Hardness and Approximation for the k-Burning Number Problem. CoRR abs/2006.14733 (2020)
2010 – 2019
- 2018
- [j10]Sandi Klavzar, D. Azubha Jemilet, Indra Rajasingh, Paul D. Manuel, N. Parthiban:
General Transmission Lemma and Wiener complexity of triangular grids. Appl. Math. Comput. 338: 115-122 (2018) - [j9]Xiaofang Jiang, Qinghui Liu, N. Parthiban, R. Sundara Rajan:
A note on minimum linear arrangement for BC graphs. Discret. Math. Algorithms Appl. 10(2): 1850023:1-1850023:7 (2018) - 2017
- [j8]N. Parthiban, Joe Ryan, Indra Rajasingh, R. Sundara Rajan, L. Nirmala Rani:
Exact wirelength of embedding chord graph into tree-based architectures. Int. J. Netw. Virtual Organisations 17(1): 76-87 (2017) - [i1]Xiaofang Jiang, Qinghui Liu, Natarajan Parthiban, R. Sundara Rajan:
A note on minimum linear arrangement for BC graphs. CoRR abs/1703.01149 (2017) - 2016
- [j7]Indra Rajasingh, Paul D. Manuel, N. Parthiban, D. Azubha Jemilet, R. Sundara Rajan:
Transmission in Butterfly Networks. Comput. J. 59(8): 1174-1179 (2016) - [j6]M. Umaparvathi, N. Bhalaji, S. Jothi Prasanna, N. Parthiban:
Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks. Wirel. Pers. Commun. 90(2): 985-1001 (2016) - 2015
- [j5]Mirka Miller, R. Sundara Rajan, N. Parthiban, Indra Rajasingh:
Minimum Linear Arrangement of Incomplete Hypercubes. Comput. J. 58(2): 331-337 (2015) - [j4]R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh, N. Parthiban, Mirka Miller:
A Lower Bound for Dilation of an Embedding. Comput. J. 58(12): 3271-3278 (2015) - [j3]Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
Bothway embedding of circulant network into grid. J. Discrete Algorithms 33: 2-9 (2015) - [j2]R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
Embedding of Recursive Circulants into Certain Necklace Graphs. Math. Comput. Sci. 9(2): 253-263 (2015) - [c2]Paul D. Manuel, Indra Rajasingh, R. Sundara Rajan, N. Parthiban, T. M. Rajalaxmi:
A Tight Bound for Congestion of an Embedding. CALDAM 2015: 229-237 - 2014
- [j1]R. Sundara Rajan, Indra Rajasingh, N. Parthiban, T. M. Rajalaxmi:
A linear time algorithm for embedding hypercube into cylinder and torus. Theor. Comput. Sci. 542: 108-115 (2014) - [c1]R. Sundara Rajan, Indra Rajasingh, Paul D. Manuel, T. M. Rajalaxmi, N. Parthiban:
Embedding Circulant Networks into Butterfly and Benes Networks. IWOCA 2014: 298-306
Coauthor Index
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-10-07 21:26 CEST 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:
