Author

Narsingh Deo

Millican Chair Professor of Computer Science, University of Central Florida - Cited by 10,668 - graph theory - networks - parallel computation - discrete optimization

Biography

Doctor Narsingh Deo in 1Department of Electrical Engineering and Computer Science, University of Central Florida, Orlando, USA is an eminent researcher in field information technology and is expertized in the various fields. One of his renowned works are “Big-Data-Driven Control Strategies for Complex Networks” has been disseminated to the widest audience of experts; and thus increased in readership, citations and altmetric score.
Title
Cited by
Year
Graph theory with applications to engineering and computer science
N DeoCourier Dover Publications, 2017201
3443
2017
Discrete optimization algorithms: with Pascal programs
N Deo, JS KowalikCourier Corporation, 2006200
713
2006
On the complexity of finding optimal global alliances
A Cami, H Balakrishnan, N Deo, RD DuttonJournal of Combinatorial Mathematics and Combinatorial Computing 58, 23, 2006200
54
2006
Discovering communities in complex networks
H Balakrishnan, N DeoProceedings of the 44th annual Southeast regional conference, 280-285, 2006200
52
2006
Preferential deletion in dynamic models of web-like networks
N Deo, A CamiInformation processing letters 102 (4), 156-162, 2007200
33
2007
Techniques for analyzing dynamic random graph models of web‐like networks: An overview
A Cami, N DeoNetworks: An International Journal 51 (4), 211-255, 2008200
32
2008
Degree-correlation of scale-free graphs
Z Nikoloski, N Deo, L KuceraDiscrete Mathematics & Theoretical Computer Science, 2005200
22
2005
Efficient community identification in complex networks
M Vasudevan, N DeoSocial Network Analysis and Mining 2, 345-359, 2012201
19
2012
Correlation model of worm propagation on scale-free networks
Z Nikoloski, N Deo, L KuceraComplexus 3 (1-3), 169-182, 2006200
19
2006
A highly scalable model for network attack identification and path prediction
S Nanda, N DeoProceedings 2007 IEEE SoutheastCon, 663-668, 2007200
17
2007
Linear-time algorithms for encoding trees as sequences of node labels
P Micikevicius, S Caminiti, N DeoCongressus Numerantium 183, 65, 2006200
13
2006
Community discovery algorithms: an overview
M Vasudevan, H Balakrishnan, N DeoCongressus Numerantium 196, 127-142, 2009200
10
2009
Efficient isomorphism of miyazaki graphs
G Tener, N Deoalgorithms 5 (7), 2008200
9
2008
Detecting communities using bibliographic metrics.
H Balakrishnan, N DeoGrC, 293-29, 2006200
8
2006
A game-theoretic approach for detection of overlapping communities in dynamic complex networks
E Havvaei, N DeoInt. J. Math. Comput. Methods 1, 313-324, 2016201
7
2016
Centrality based community discovery
H Balakrishnan, N DeoCongressus Numerantium 188, 117, 2007200
6
2007
Methods for placing data and parity to tolerate two disk failures in disk arrays using complete bipartite graphs
S Nanda, N DeoCongressus Numerantium 179, 17, 20020
6
2006
Accelerating the distributed simulations of agent-based models using community detection
A Petkova, C Hughes, N Deo, M Dimitrov201 IEEE RIVF International Conference on Computing & Communication …, 20120
6
2016
Attacks on hard instances of graph isomorphism
G Tener, N DeoJournal of Combinatorial Mathematics and Combinatorial Computing 64, 203-22, 2008200
5
2008
Graph compression and the zeros of polynomials
B Litow, N DeoInformation processing letters 92 (1), 39-44, 2004200
5
2004

Referred From: https://scholar.google.com/citations?user=2uiQgfMAAAAJ&hl=en&oi=ao

Cited by
Citations 10668
h-index 35
i10-index 78
Open Access Journals