Boting Yang
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
- Rough Sets and Fuzzy Logic
-
- Computational Geometry and Mesh Generation
Papers in
-
- Advanced Graph Theory Research 30
- Complexity and Algorithms in Graphs 9
- Graph Labeling and Dimension Problems 7
-
- Optimization and Search Problems 20
- Co-authors
- Brian Alspach (4 shared papers)Danny Dyer (4 shared papers)Binhai Zhu (9 shared papers)Zhiyu Zhao (4 shared papers)Bin Fu (4 shared papers)Zhixiang Chen (3 shared papers)Cory J. Butz (2 shared papers)Yuan Xue (6 shared papers)
- Journals
- Theoretical Computer Science (9 papers)Journal of Combinatorial Optimization (5 papers)Lecture notes in computer science (24 papers)Algorithmica (1 paper)Discrete Applied Mathematics (1 paper)
- Partner nations
- CanadaChinaUnited States
In The Last Decade
Boting Yang
48 papers receiving 282 citations
Peers
Comparison fields: 5 of 33
- Computational Theory and Mathematics 180
- Computer Graphics and Computer-Aided Design 28
- Discrete Mathematics and Combinatorics 19
- Computer Networks and Communications 107
- Geometry and Topology 20
Countries citing papers authored by Boting Yang
This map shows the geographic impact of Boting Yang'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 Boting Yang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Boting Yang more than expected).
Fields of papers citing papers by Boting Yang
This network shows the impact of papers produced by Boting Yang. 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 Boting Yang. The network helps show where Boting Yang may publish in the future.
Co-authors
The 25 scholars most cited alongside Boting Yang, 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 52 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2004 | 29 | |
| 2 | 2008 | 28 | |
| 3 | 2013 | 23 | |
| 4 | 2007 | 19 | |
| 5 | 2011 | 12 | |
| 6 | 2005 | 12 | |
| 7 | 2008 | 12 | |
| 8 | 2006 | 11 | |
| 9 | 2007 | 11 | |
| 10 | Integer Programming Methods for Several Optimization Problems in Graph Theory. | 2005 | 8 |
| 11 | 2007 | 8 | |
| 12 | 2007 | 7 | |
| 13 | 2000 | 7 | |
| 14 | 2006 | 7 | |
| 15 | 2008 | 6 | |
| 16 | 2002 | 6 | |
| 17 | 2007 | 6 | |
| 18 | 2008 | 5 | |
| 19 | 2014 | 5 | |
| 20 | 2017 | 5 |
About Boting Yang
Boting Yang is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design and Computer Vision and Pattern Recognition, having authored 52 papers that have together received 295 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (30 papers), Optimization and Search Problems (20 papers), Computational Geometry and Mesh Generation (14 papers), Algorithms and Data Compression (12 papers), Complexity and Algorithms in Graphs (9 papers), Graph Labeling and Dimension Problems (7 papers), Data Management and Algorithms (4 papers) and Genome Rearrangement Algorithms (4 papers). The work is most often cited by research in Computational Theory and Mathematics (180 citations), Computer Graphics and Computer-Aided Design (28 citations), Discrete Mathematics and Combinatorics (19 citations), Computer Networks and Communications (107 citations) and Geometry and Topology (20 citations). Boting Yang has collaborated with scholars based in Canada, China and United States. Frequent co-authors include Brian Alspach, Danny Dyer, Binhai Zhu, Zhiyu Zhao, Bin Fu, Zhixiang Chen, Cory J. Butz, Yuan Xue, Robert Schweller and Yi Cao. Their work appears in journals such as Theoretical Computer Science, Journal of Combinatorial Optimization, Lecture notes in computer science, Algorithmica and Discrete Applied 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.