Zhengbing Bian

663 total citations
12 papers, 223 citations indexed

About

Zhengbing Bian is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Electrical and Electronic Engineering. According to data from OpenAlex, Zhengbing Bian has authored 12 papers receiving a total of 223 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Zhengbing Bian's work include Advanced Graph Theory Research (6 papers), Quantum Computing Algorithms and Architecture (5 papers) and Advanced Optical Network Technologies (5 papers). Zhengbing Bian is often cited by papers focused on Advanced Graph Theory Research (6 papers), Quantum Computing Algorithms and Architecture (5 papers) and Advanced Optical Network Technologies (5 papers). Zhengbing Bian collaborates with scholars based in Canada, United States and Japan. Zhengbing Bian's co-authors include William G. Macready, Fabián A. Chudak, Aidan Roy, Robert B. Israel, Brad Lackey, Frank Gaitan, Lane Clark, Qian‐Ping Gu, Roberto Sebastiani and Xiao Zhou and has published in prestigious journals such as Physical Review Letters, Networks and Discrete Applied Mathematics.

In The Last Decade

Zhengbing Bian

12 papers receiving 206 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Zhengbing Bian Canada	5	193	82	43	38	19	12	223
Rajagopal Nagarajan United Kingdom	9	208 1.1×	71 0.9×	85 2.0×	23 0.6×	21 1.1×	26	235
Andrea Skolik Netherlands	6	375 1.9×	80 1.0×	101 2.3×	55 1.4×	10 0.5×	8	412
Yoshiaki Kawase Japan	5	186 1.0×	42 0.5×	79 1.8×	20 0.5×	15 0.8×	6	238
Holger Bock Axelsen Denmark	7	151 0.8×	120 1.5×	15 0.3×	28 0.7×	29 1.5×	13	183
Lingling Lao Netherlands	10	254 1.3×	78 1.0×	96 2.2×	68 1.8×	18 0.9×	15	291
Ruslan Shaydulin United States	12	368 1.9×	118 1.4×	101 2.3×	32 0.8×	16 0.8×	25	407
Ben Criger Netherlands	9	227 1.2×	95 1.2×	89 2.1×	36 0.9×	34 1.8×	11	253
José Félix Costa Portugal	10	199 1.0×	278 3.4×	28 0.7×	12 0.3×	16 0.8×	45	337
Noson S. Yanofsky United States	5	168 0.9×	70 0.9×	76 1.8×	11 0.3×	18 0.9×	8	231
Franc̨ois Arnault France	8	109 0.6×	25 0.3×	40 0.9×	27 0.7×	9 0.5×	16	140

Countries citing papers authored by Zhengbing Bian

Since Specialization

Citations

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

Fields of papers citing papers by Zhengbing Bian

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Zhengbing Bian

This figure shows the co-authorship network connecting the top 25 collaborators of Zhengbing Bian. A scholar is included among the top collaborators of Zhengbing Bian 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 Zhengbing Bian. Zhengbing Bian 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:

12 of 12 papers shown

Bian, Zhengbing, et al.. (2020). Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results. Information and Computation. 275. 104609–104609. 18 indexed citations

Vahdat, Arash, et al.. (2018). DVAE++: Discrete Variational Autoencoders with Overlapping Transformations. International Conference on Machine Learning. 5035–5044. 2 indexed citations

Bian, Zhengbing, Fabián A. Chudak, Robert B. Israel, et al.. (2016). Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis. 3. 46 indexed citations

Bian, Zhengbing, Qian‐Ping Gu, & Mingzhe Zhu. (2015). Practical algorithms for branch-decompositions of planar graphs. Discrete Applied Mathematics. 199. 156–171. 1 indexed citations

Bian, Zhengbing, Fabián A. Chudak, Robert B. Israel, et al.. (2014). Discrete optimization using quantum annealing on sparse Ising models. Frontiers in Physics. 2. 79 indexed citations

Bian, Zhengbing, Fabián A. Chudak, William G. Macready, Lane Clark, & Frank Gaitan. (2013). Experimental Determination of Ramsey Numbers. Physical Review Letters. 111(13). 130505–130505. 61 indexed citations

Bian, Zhengbing, Fabián A. Chudak, William G. Macready, Lane Clark, & Frank Gaitan. (2012). Experimental determination of Ramsey numbers with quantum annealing. arXiv (Cornell University). 7 indexed citations

Bian, Zhengbing & Qian‐Ping Gu. (2009). Wavelength assignment in multifiber star networks. Networks. 56(1). 30–38. 1 indexed citations

Bian, Zhengbing & Qian‐Ping Gu. (2008). 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. Information Processing Letters. 109(8). 400–404. 1 indexed citations

10.

Bian, Zhengbing, Qian‐Ping Gu, & Xiao Zhou. (2008). Efficient algorithms for wavelength assignment on trees of rings. Discrete Applied Mathematics. 157(5). 875–889. 1 indexed citations

11.

Bian, Zhengbing, et al.. (2004). Wavelength assignment on bounded degree trees of rings. 73–80. 3 indexed citations

12.

Bian, Zhengbing, Qian‐Ping Gu, & Xiao Zhou. (2004). Wavelength assignment on bounded degree trees of rings. 70. 73–80. 3 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