Hamed Nassar

48 papers receiving 332 citations

Peers

Hamed Nassar
Comparison fields: 5 of 60
  • Computer Networks and Communications 118
  • Information Systems 99
  • Artificial Intelligence 69
  • Radiology, Nuclear Medicine and Imaging 65
  • Computational Theory and Mathematics 61
Replace C. Nalini with:
C. Nalini India
Abbas Vafaei Iran
Yongwang Zhao China
Zhanshan Li China
Christos Kloukinas United Kingdom
S. Janakiraman India
Abderrahim Sekkaki Morocco
Myungho Lee South Korea
Farhad Mardukhi Iran
Rahul Hans India
Hamed Nassar relative to C. Nalini India C. Nalini's profile →
Citations per field
00.5×5.3×
C. Nalini · 1×
Citations per year

Countries citing papers authored by Hamed Nassar

Since Specialization
Citations

This map shows the geographic impact of Hamed Nassar'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 Hamed Nassar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hamed Nassar more than expected).

Fields of papers citing papers by Hamed Nassar

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Hamed Nassar. 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 Hamed Nassar. The network helps show where Hamed Nassar may publish in the future.

Co-authorship network of co-authors of Hamed Nassar

This figure shows the co-authorship network connecting the top 25 collaborators of Hamed Nassar. A scholar is included among the top collaborators of Hamed Nassar 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 Hamed Nassar. Hamed Nassar 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 1
2 0
3 3
4 0
5 6
6 11
7 24
8 7
9 15
10 42
11 1
12 1
13 6
14 53
15 1
16 3
17
Bilateral Agent Negotiation for E-Commerce Based On Fuzzy Logic.
1
18 2
19 2
20
Fault-tolerant interconnection networks for multiprocessor systems
1

About Hamed Nassar

Hamed Nassar is a scholar working on Computer Networks and Communications, Management Information Systems and Computer Graphics and Computer-Aided Design, having authored 52 papers that have together received 353 indexed citations. Recurring topics across this work include Advanced Queuing Theory Analysis (9 papers), Network Traffic and Congestion Control (7 papers) and Rough Sets and Fuzzy Logic (6 papers). The work is most often cited by research in Computer Networks and Communications (118 citations), Information Systems (99 citations) and Management Information Systems (37 citations). Hamed Nassar has collaborated with scholars based in Egypt, Saudi Arabia and Lebanon. Frequent co-authors include Mohamed Elshrkawey, Mohamed Taha, Tarek F. Gharib, Ajith Abraham, Sherine M. Abd El-Kader, M. A. Makhlouf, Abd El Rahman Shabayek, Nabil A. Ismail, Hany F. ElYamany and Arabi Keshk. Their work appears in journals such as IEEE Access, Information Sciences and Applied Sciences.

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