Gexin Yu
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
Papers in
-
- Advanced Graph Theory Research 64
- Graph Labeling and Dimension Problems 25
-
- Limits and Structures in Graph Theory 35
- Co-authors
- Alexandr Kostochka (16 shared papers)Qun Li (2 shared papers)Daniel W. Cranston (5 shared papers)Yifan Zhang (1 shared paper)Baosheng Wang (1 shared paper)Seog‐Jin Kim (3 shared papers)Rui Xu (2 shared papers)Xiangwen Li (8 shared papers)
- Journals
- Discrete Mathematics (21 papers)Discrete Applied Mathematics (11 papers)Journal of Graph Theory (10 papers)European Journal of Combinatorics (7 papers)SIAM Journal on Discrete Mathematics (6 papers)
- Partner nations
- United StatesChinaRussia
In The Last Decade
Gexin Yu
73 papers receiving 750 citations
Peers
Comparison fields: 5 of 37
- Discrete Mathematics and Combinatorics 245
- Computational Theory and Mathematics 600
- Computer Graphics and Computer-Aided Design 101
- Computer Networks and Communications 259
- Geometry and Topology 90
Countries citing papers authored by Gexin Yu
This map shows the geographic impact of Gexin Yu'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 Gexin Yu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gexin Yu more than expected).
Fields of papers citing papers by Gexin Yu
This network shows the impact of papers produced by Gexin Yu. 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 Gexin Yu. The network helps show where Gexin Yu may publish in the future.
Co-authors
The 25 scholars most cited alongside Gexin Yu, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 79 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 97 | |
| 2 | 2013 | 33 | |
| 3 | 2006 | 27 | |
| 4 | 2008 | 26 | |
| 5 | 2005 | 26 | |
| 6 | 2010 | 26 | |
| 7 | 2010 | 25 | |
| 8 | 2008 | 22 | |
| 9 | 2018 | 22 | |
| 10 | 2013 | 21 | |
| 11 | 2015 | 21 | |
| 12 | 2022 | 19 | |
| 13 | 2018 | 18 | |
| 14 | 2007 | 16 | |
| 15 | 2005 | 16 | |
| 16 | 2009 | 14 | |
| 17 | 2013 | 14 | |
| 18 | 2019 | 13 | |
| 19 | 2006 | 13 | |
| 20 | 2019 | 13 |
About Gexin Yu
Gexin Yu is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Electrical and Electronic Engineering and Computer Graphics and Computer-Aided Design, having authored 79 papers that have together received 772 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (64 papers), Limits and Structures in Graph Theory (35 papers), Graph Labeling and Dimension Problems (25 papers), Computational Geometry and Mesh Generation (14 papers), graph theory and CDMA systems (14 papers), Interconnection Networks and Systems (12 papers), Graph theory and applications (7 papers) and Optimization and Search Problems (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (245 citations), Computational Theory and Mathematics (600 citations), Computer Graphics and Computer-Aided Design (101 citations), Computer Networks and Communications (259 citations) and Geometry and Topology (90 citations). Gexin Yu has collaborated with scholars based in United States, China and Russia. Frequent co-authors include Alexandr Kostochka, Qun Li, Daniel W. Cranston, Yifan Zhang, Baosheng Wang, Seog‐Jin Kim, Rui Xu, Xiangwen Li, Rong Luo and Ken‐ichi Kawarabayashi. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Journal of Graph Theory, European Journal of Combinatorics and SIAM Journal on 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.