Narsingh Deo

86 papers receiving 3.0k citations

Hit Papers

GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTE...197520261992200919751977250500750

Peers

Narsingh Deo
Comparison fields: 5 of 144
  • Computer Networks and Communications 1.0k
  • Computational Theory and Mathematics 884
  • Electrical and Electronic Engineering 683
  • Artificial Intelligence 650
  • Industrial and Manufacturing Engineering 418
Replace Robert W. Floyd with:
Robert W. Floyd United States
Raymond E. Miller United States
Kenneth Steiglitz United States
Clifford Stein United States
Harold N. Gabow United States
Shimon Even Israel
J. W. Thatcher United States
Michael S. Paterson United Kingdom
Adam N. Letchford United Kingdom
Narendra Karmarkar United States
Narsingh Deo relative to Robert W. Floyd United States Robert W. Floyd's profile →
Citations per field
00.5×1.5×
Robert W. Floyd · 1×
Citations per year

Countries citing papers authored by Narsingh Deo

Since Specialization
Citations

This map shows the geographic impact of Narsingh Deo's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Narsingh Deo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Narsingh Deo more than expected).

Fields of papers citing papers by Narsingh Deo

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Narsingh Deo. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Narsingh Deo. The network helps show where Narsingh Deo may publish in the future.

Co-authorship network of co-authors of Narsingh Deo

This figure shows the co-authorship network connecting the top 25 collaborators of Narsingh Deo. A scholar is included among the top collaborators of Narsingh Deo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Narsingh Deo. Narsingh Deo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1
Attacks on difficult instances of graph isomorphism: sequential and parallel algorithms
3
2 14
3 5
4 1
5
World Wide Web: A Graph-Theoretic Perspective
4
6
Parallel algorithms for the molecular conformation problem
1
7 4
8 2
9 4
10 4
11 0
12 6
13
An Optimal Parallel Parsing Algorithm for a Class of Block Structured Languages.
3
14 49
15 1
16
Estimating the Speedup in Parallel Parsing.
2
17 15
18
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
281
19
An extensive English language bibliography on graph theory and its applications
1
20 2

About Narsingh Deo

Narsingh Deo is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Hardware and Architecture, having authored 92 papers that have together received 3.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (14 papers), Complex Network Analysis Techniques (13 papers) and Complexity and Algorithms in Graphs (12 papers). The work is most often cited by research in Hardware and Architecture (383 citations), Computational Theory and Mathematics (884 citations) and Computer Networks and Communications (1.0k citations). Narsingh Deo has collaborated with scholars based in United States, India and Switzerland. Frequent co-authors include Edward M. Reingold, Jürg Nievergelt, C. Y. Pang, Mukkai S. Krishnamoorthy, Tony Greenfield, Maciej M. Sysło, Janusz S. Kowalik, Sushil K. Prasad, Ayman M. Abdalla and Michael A. Langston. Their work appears in journals such as Annals of the New York Academy of Sciences, ACM Computing Surveys and BMC Bioinformatics.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026