N. Parthiban

Orcid: 0000-0002-2170-6403

According to our database1, N. Parthiban authored at least 21 papers between 2014 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
APX-hardness and approximation for the <i>k</i>-burning number problem.
Theor. Comput. Sci., 2022

A review of the state of the art in business intelligence software.
Enterp. Inf. Syst., 2022

Oriented Diameter of Planar Triangulations.
CoRR, 2022

Bounds for the Oriented Diameter of Planar Triangulations.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

2021
Optimal layout of recursive circulant graphs.
Int. J. Comput. Math. Comput. Syst. Theory, 2021

APX-Hardness and Approximation for the k-Burning Number Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

IoT based Circadian Rhythm Monitoring using Fuzzy Logic.
Proceedings of the 6th International Conference on Internet of Things, 2021

Role of Artificial Intelligence of Things (AIoT) in Covid-19 Pandemic: A Brief Survey.
Proceedings of the 6th International Conference on Internet of Things, 2021

2020
Two-stage data encryption using chaotic neural networks.
J. Intell. Fuzzy Syst., 2020

2018
A note on minimum linear arrangement for BC graphs.
Discret. Math. Algorithms Appl., 2018

General Transmission Lemma and Wiener complexity of triangular grids.
Appl. Math. Comput., 2018

2017
Exact wirelength of embedding chord graph into tree-based architectures.
Int. J. Netw. Virtual Organisations, 2017

2016
Analysis of Creido Enhanced Chord Overlay Protocol Under Different Movement Models in Delay Tolerant Networks.
Wirel. Pers. Commun., 2016

Transmission in Butterfly Networks.
Comput. J., 2016

2015
Embedding of Recursive Circulants into Certain Necklace Graphs.
Math. Comput. Sci., 2015

Bothway embedding of circulant network into grid.
J. Discrete Algorithms, 2015

A Lower Bound for Dilation of an Embedding.
Comput. J., 2015

Minimum Linear Arrangement of Incomplete Hypercubes.
Comput. J., 2015

A Tight Bound for Congestion of an Embedding.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2015

2014
A linear time algorithm for embedding hypercube into cylinder and torus.
Theor. Comput. Sci., 2014

Embedding Circulant Networks into Butterfly and Benes Networks.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014


  Loading...