Boting Yang

461 total citations
28 papers, 115 citations indexed

About

Boting Yang is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Boting Yang has authored 28 papers receiving a total of 115 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 9 papers in Artificial Intelligence. Recurrent topics in Boting Yang's work include Advanced Graph Theory Research (15 papers), Optimization and Search Problems (11 papers) and Computational Geometry and Mesh Generation (8 papers). Boting Yang is often cited by papers focused on Advanced Graph Theory Research (15 papers), Optimization and Search Problems (11 papers) and Computational Geometry and Mesh Generation (8 papers). Boting Yang collaborates with scholars based in Canada, China and United States. Boting Yang's co-authors include Robert Schweller, Binhai Zhu, Bin Fu, Zhiyu Zhao, Zhixiang Chen, Yuan Xue, Michael J. Pelsmajer, Yi Cao, Zhizhang Shen and Sandra Zilles and has published in prestigious journals such as Theoretical Computer Science, Journal of Computational Biology and Discrete Applied Mathematics.

In The Last Decade

Boting Yang

25 papers receiving 110 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Boting Yang Canada	6	65	32	29	25	18	28	115
Michael Dom Germany	6	108 1.7×	29 0.9×	11 0.4×	10 0.4×	17 0.9×	10	122
Toshiki Saitoh Japan	8	80 1.2×	40 1.3×	16 0.6×	11 0.4×	16 0.9×	26	129
Rudi Pendavingh Netherlands	7	89 1.4×	19 0.6×	14 0.5×	5 0.2×	19 1.1×	26	138
Siu On Chan United States	5	76 1.2×	25 0.8×	12 0.4×	16 0.6×	4 0.2×	13	117
Alexandru Popa Romania	7	65 1.0×	53 1.7×	23 0.8×	5 0.2×	19 1.1×	37	151
Rüdiger Rudolf Austria	7	60 0.9×	16 0.5×	5 0.2×	5 0.2×	21 1.2×	12	104
Felix Reidl Germany	7	85 1.3×	19 0.6×	28 1.0×	3 0.1×	8 0.4×	18	125
Florian Sikora France	7	53 0.8×	22 0.7×	30 1.0×	7 0.3×	4 0.2×	15	101
Fabien de Montgolfier France	6	71 1.1×	48 1.5×	15 0.5×	11 0.4×	13 0.7×	17	129
K. Yu. Gorbunov Russia	7	81 1.2×	31 1.0×	106 3.7×	84 3.4×	6 0.3×	31	200

Countries citing papers authored by Boting Yang

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Boting Yang

This figure shows the co-authorship network connecting the top 25 collaborators of Boting Yang. A scholar is included among the top collaborators of Boting Yang 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 Boting Yang. Boting Yang is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Yang, Boting, et al.. (2019). Search Numbers in Networks with Special Topologies. Journal of Interconnection Networks. 19(1). 1940004–1940004. 2 indexed citations

Wang, Lusheng & Boting Yang. (2018). Positive semidefinite zero forcing numbers of two classes of graphs. Theoretical Computer Science. 786. 44–54. 2 indexed citations

Kirkpatrick, David, Boting Yang, & Sandra Zilles. (2017). On the barrier-resilience of arrangements of ray-sensors. idUS (Universidad de Sevilla).

Yang, Boting, et al.. (2016). Genomic Scaffold Filling Revisited. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Kanj, Iyad, Guohui Lin, Tian Liu, et al.. (2015). Improved parameterized and exact algorithms for cut problems on trees. Theoretical Computer Science. 607. 455–470. 1 indexed citations

Yang, Boting. (2015). Lower bounds for positive semidefinite zero forcing and their applications. Journal of Combinatorial Optimization. 33(1). 81–105. 3 indexed citations

Chen, Zhixiang, Bin Fu, Randy Goebel, et al.. (2014). On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theoretical Computer Science. 550. 59–65. 3 indexed citations

Kirkpatrick, David, Boting Yang, & Sandra Zilles. (2014). A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS. International Journal of Computational Geometry & Applications. 24(3). 225–236. 2 indexed citations

Yang, Boting. (2013). Fast–mixed searching and related problems on graphs. Theoretical Computer Science. 507. 100–113. 18 indexed citations

10.

Yang, Boting. (2012). Euclidean chains and their shortcuts. Theoretical Computer Science. 497. 55–67. 4 indexed citations

11.

Yang, Boting. (2011). Fast edge searching and fast searching on graphs. Theoretical Computer Science. 412(12-14). 1208–1219. 7 indexed citations

12.

Alspach, Brian, et al.. (2008). Time constrained graph searching. Theoretical Computer Science. 399(3). 158–168. 4 indexed citations

13.

Yang, Boting, et al.. (2008). Monotonicity in digraph search problems. Theoretical Computer Science. 407(1-3). 532–544. 3 indexed citations

14.

Chen, Zhixiang, Bin Fu, Robert Schweller, et al.. (2008). Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. Journal of Computational Biology. 15(5). 535–546. 26 indexed citations

15.

Yang, Boting, et al.. (2007). Standard directed search strategies and their applications. Journal of Combinatorial Optimization. 17(4). 378–399. 1 indexed citations

16.

Yang, Boting. (2006). Strong-mixed searching and pathwidth. Journal of Combinatorial Optimization. 13(1). 47–59. 4 indexed citations

17.

Pelsmajer, Michael J., et al.. (2005). Integer Programming Methods for Several Optimization Problems in Graph Theory.. Computers and Their Applications. 50–55. 7 indexed citations

18.

Yang, Boting, et al.. (2005). On the Computation and Chromatic Number of Colored Domino Tilings.. Canadian Conference on Computational Geometry. 203–206.

19.

Stevens, Brett, et al.. (2002). Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2. Discrete Mathematics. 258(1-3). 193–204. 6 indexed citations

20.

Yang, Boting, et al.. (2000). The class Steiner minimal tree problem: a lower bound and test problem generation. Acta Informatica. 37(3). 193–211. 6 indexed citations

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