Reza Naserasr
- Computational Theory and Mathematics top 2%
- Discrete Mathematics and Combinatorics top 5%
- Geometry and Topology top 10%
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Co-authors
- Florent FoucaudE. S. MahmoodianAline ParreauBrett StevensPavol HellRiste ŠkrekovskiThomas ZasĺavskyGeorge B. Mertzios
- Topics
- Advanced Graph Theory Research (38 papers)Graph Labeling and Dimension Problems (24 papers)Limits and Structures in Graph Theory (20 papers)
In The Last Decade
Reza Naserasr
38 papers receiving 248 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 224
- Discrete Mathematics and Combinatorics 98
- Geometry and Topology 59
- Electrical and Electronic Engineering 57
- Computer Networks and Communications 29
Countries citing papers authored by Reza Naserasr
This map shows the geographic impact of Reza Naserasr'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 Reza Naserasr with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Reza Naserasr more than expected).
Fields of papers citing papers by Reza Naserasr
This network shows the impact of papers produced by Reza Naserasr. 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 Reza Naserasr. The network helps show where Reza Naserasr may publish in the future.
Co-authorship network of co-authors of Reza Naserasr
This figure shows the co-authorship network connecting the top 25 collaborators of Reza Naserasr. A scholar is included among the top collaborators of Reza Naserasr 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 Reza Naserasr. Reza Naserasr is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 2 | |
| 4 | 1 | |
| 5 | 2 | |
| 6 | 0 | |
| 7 | 1 | |
| 8 | 13 | |
| 9 | 16 | |
| 10 | Bipartite edge partitions and the former Alon-Saks-Seymour conjecture | 1 |
| 11 | 17 | |
| 12 | 2 | |
| 13 | 4 | |
| 14 | 1 | |
| 15 | 19 | |
| 16 | 3 | |
| 17 | 0 | |
| 18 | 4 | |
| 19 | 2 | |
| 20 | 27 |
About Reza Naserasr
Reza Naserasr is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 45 papers that have together received 260 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (38 papers), Graph Labeling and Dimension Problems (24 papers) and Limits and Structures in Graph Theory (20 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (98 citations), Computational Theory and Mathematics (224 citations) and Geometry and Topology (59 citations). Reza Naserasr has collaborated with scholars based in France, Canada and China. Frequent co-authors include Florent Foucaud, E. S. Mahmoodian, Aline Parreau, Brett Stevens, Pavol Hell, Riste Škrekovski, Thomas Zasĺavsky, George B. Mertzios, Xuding Zhu and Yannis Manoussakis. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics and Discrete Mathematics.
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.