Biing-Feng Wang

675 total citations
51 papers, 424 citations indexed

About

Biing-Feng Wang is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Biing-Feng Wang has authored 51 papers receiving a total of 424 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 23 papers in Computer Networks and Communications and 18 papers in Artificial Intelligence. Recurrent topics in Biing-Feng Wang's work include Optimization and Search Problems (17 papers), Facility Location and Emergency Management (17 papers) and Algorithms and Data Compression (17 papers). Biing-Feng Wang is often cited by papers focused on Optimization and Search Problems (17 papers), Facility Location and Emergency Management (17 papers) and Algorithms and Data Compression (17 papers). Biing-Feng Wang collaborates with scholars based in Taiwan, France and Japan. Biing-Feng Wang's co-authors include Gen-Huey Chen, Hungwen Li, Chi-Jen Lu, Chien‐Hsin Lin, Wing-Kai Hon, Jia-Shung Wang, Krister M. Swenson, Shietung Peng, Wei‐Kuan Shih and Chuan Yi Tang and has published in prestigious journals such as Information Sciences, IEEE Transactions on Parallel and Distributed Systems and Theoretical Computer Science.

In The Last Decade

Biing-Feng Wang

46 papers receiving 404 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Biing-Feng Wang Taiwan 11 252 113 103 89 76 51 424
Ralf Klasing France 14 462 1.8× 206 1.8× 21 0.2× 15 0.2× 44 0.6× 73 618
Frances Yao United States 14 445 1.8× 87 0.8× 99 1.0× 4 0.0× 33 0.4× 30 594
Giulia Galbiati Italy 12 168 0.7× 269 2.4× 9 0.1× 17 0.2× 171 2.3× 32 469
Kenneth D. Boese United States 10 185 0.7× 77 0.7× 225 2.2× 11 0.1× 139 1.8× 11 663
A. Ferreira France 9 475 1.9× 67 0.6× 118 1.1× 4 0.0× 48 0.6× 31 616
Roberto Solis-Oba Canada 12 179 0.7× 122 1.1× 6 0.1× 23 0.3× 221 2.9× 46 408
Shoji Shinoda Japan 9 222 0.9× 67 0.6× 12 0.1× 28 0.3× 9 0.1× 97 346
Sergei Bespamyatnikh Canada 11 75 0.3× 68 0.6× 4 0.0× 41 0.5× 37 0.5× 29 339
Cláudio N. Meneses Brazil 9 41 0.2× 90 0.8× 19 0.2× 8 0.1× 73 1.0× 21 271
Daniel E. Steffy United States 8 113 0.4× 183 1.6× 26 0.3× 3 0.0× 100 1.3× 16 388

Countries citing papers authored by Biing-Feng Wang

Since Specialization
Citations

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

Fields of papers citing papers by Biing-Feng Wang

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Biing-Feng Wang

This figure shows the co-authorship network connecting the top 25 collaborators of Biing-Feng Wang. A scholar is included among the top collaborators of Biing-Feng Wang 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 Biing-Feng Wang. Biing-Feng Wang 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
1.
Wang, Biing-Feng. (2022). Fast Algorithms for the Simplified Partial Digest Problem. Journal of Computational Biology. 30(1). 41–51.
2.
Wang, Biing-Feng, et al.. (2016). Efficient algorithms for the round-trip 1-center and 1-median problems. Journal of Computer and System Sciences. 82(5). 782–792.
3.
Wang, Biing-Feng, et al.. (2015). On the minmax regret path median problem on trees. Journal of Computer and System Sciences. 81(7). 1159–1170. 7 indexed citations
4.
Bhattacharya, Binay, et al.. (2012). Efficient algorithms for the conditional covering problem. Information and Computation. 219. 39–57. 1 indexed citations
5.
Wang, Biing-Feng. (2011). Output-Sensitive Algorithms for Finding the Nested Common Intervals of Two General Sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9(2). 548–559. 1 indexed citations
6.
Wang, Biing-Feng, et al.. (2011). A New Efficient Algorithm for the Gene-Team Problem on General Sequences. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 9(2). 330–344. 4 indexed citations
7.
Hon, Wing-Kai, et al.. (2011). Faster query algorithms for the text fingerprinting problem. Information and Computation. 209(7). 1057–1069. 2 indexed citations
8.
Hon, Wing-Kai, et al.. (2010). Improved data structures for the orthogonal range successor problem. Computational Geometry. 44(3). 148–159. 9 indexed citations
9.
Lin, Chien‐Hsin, et al.. (2010). Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. Journal of Computer and System Sciences. 76(8). 697–708. 4 indexed citations
10.
Wang, Biing-Feng & Chien‐Hsin Lin. (2010). Improved Algorithms for Finding Gene Teams and Constructing Gene Team Trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 8(5). 1258–1272. 9 indexed citations
11.
Wang, Biing-Feng, et al.. (2009). Efficient algorithms for the inverse sorting problem with bound constraints under the l∞-norm and the Hamming distance. Journal of Computer and System Sciences. 75(8). 451–464. 5 indexed citations
12.
Wang, Biing-Feng, et al.. (2008). Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 5(2). 281–290. 5 indexed citations
13.
Lu, Chi-Jen, et al.. (2008). Efficient algorithms for two generalized 2-median problems and the group median problem on trees. Theoretical Computer Science. 410(8-10). 867–876. 3 indexed citations
14.
Wang, Biing-Feng. (2004). Finding r-dominating sets and p-centers of trees in parallel. IEEE Transactions on Parallel and Distributed Systems. 15(8). 687–698. 4 indexed citations
15.
Wang, Biing-Feng. (2004). Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms. 54(1). 45–57. 21 indexed citations
16.
Chen, Gen-Huey, Biing-Feng Wang, & Hungwen Li. (1993). Deriving algorithms on reconfigurable networks based on function decomposition. Theoretical Computer Science. 120(2). 215–227. 10 indexed citations
17.
Wang, Biing-Feng, et al.. (1991). Bitonic Sort with an Arbitrary Number of Keys.. Proceedings of the International Conference on Parallel Processing. 58–61. 4 indexed citations
18.
Wang, Biing-Feng, Gen-Huey Chen, & Hungwen Li. (1991). Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems.. Proceedings of the International Conference on Parallel Processing. 42–49. 20 indexed citations
19.
Wang, Biing-Feng, et al.. (1991). Cost-Optimal Parallel Algorithms for Constructing B-Trees.. Proceedings of the International Conference on Parallel Processing. 294–295. 2 indexed citations
20.
Wang, Biing-Feng, Chi-Jen Lu, & Gen-Huey Chen. (1990). Constant Time Algorithms for the Transitive Closure Problem and Its Applications.. Proceedings of the International Conference on Parallel Processing. 52–59. 9 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

Breakdown of academic impact, for papers by Ralf Klasing Breakdown of academic impact, for papers by Frances Yao Breakdown of academic impact, for papers by Giulia Galbiati Breakdown of academic impact, for papers by Kenneth D. Boese Breakdown of academic impact, for papers by A. Ferreira Breakdown of academic impact, for papers by Roberto Solis-Oba Breakdown of academic impact, for papers by Shoji Shinoda Breakdown of academic impact, for papers by Sergei Bespamyatnikh Breakdown of academic impact, for papers by Cláudio N. Meneses Breakdown of academic impact, for papers by Daniel E. Steffy
Rankless by CCL
2026