Changhong Lü

558 total citations
53 papers, 326 citations indexed

About

Changhong Lü is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Changhong Lü has authored 53 papers receiving a total of 326 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 14 papers in Computer Networks and Communications and 10 papers in Artificial Intelligence. Recurrent topics in Changhong Lü's work include Advanced Graph Theory Research (38 papers), Graph Labeling and Dimension Problems (18 papers) and Complexity and Algorithms in Graphs (14 papers). Changhong Lü is often cited by papers focused on Advanced Graph Theory Research (38 papers), Graph Labeling and Dimension Problems (18 papers) and Complexity and Algorithms in Graphs (14 papers). Changhong Lü collaborates with scholars based in China, United States and Taiwan. Changhong Lü's co-authors include Gerard J. Chang, Lei Chen, Zhenbing Zeng, Zhengke Miao, Mingqing Zhai, Jiaojiao Wu, Qinglin Yu, Chunxia Chen, Ping Zhang and Sanming Zhou and has published in prestigious journals such as IEEE Transactions on Intelligent Transportation Systems, BioMed Research International and Transportation Research Part C Emerging Technologies.

In The Last Decade

Changhong Lü

48 papers receiving 307 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Changhong Lü China	10	275	107	98	33	29	53	326
Pranava K. Jha United States	12	253 0.9×	205 1.9×	76 0.8×	55 1.7×	39 1.3×	39	331
Toru Hasunuma Japan	8	160 0.6×	91 0.9×	151 1.5×	23 0.7×	9 0.3×	27	241
Yota Otachi Japan	9	196 0.7×	26 0.2×	104 1.1×	21 0.6×	27 0.9×	66	244
Joe Ryan Australia	11	338 1.2×	145 1.4×	67 0.7×	111 3.4×	27 0.9×	55	440
Jiaojiao Wu China	10	193 0.7×	47 0.4×	44 0.4×	67 2.0×	46 1.6×	27	288
Somnath Sikdar Germany	11	238 0.9×	31 0.3×	77 0.8×	42 1.3×	36 1.2×	23	264
Dalibor Fronček United States	9	316 1.1×	156 1.5×	25 0.3×	56 1.7×	39 1.3×	69	360
Tamás Király Hungary	7	137 0.5×	50 0.5×	54 0.6×	26 0.8×	18 0.6×	36	193
Mathieu Liedloff France	11	217 0.8×	31 0.3×	110 1.1×	39 1.2×	20 0.7×	36	276
Luérbio Faria Brazil	8	175 0.6×	37 0.3×	61 0.6×	49 1.5×	12 0.4×	56	212

Countries citing papers authored by Changhong Lü

Since Specialization

Citations

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

Fields of papers citing papers by Changhong Lü

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Changhong Lü

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

Lü, Changhong, et al.. (2025). QUBO Modeling for a Spectrum of Domination Problems. Journal of Mathematics. 2025(1).

Li, Fang, et al.. (2024). Spatiotemporal traffic data completion with truncated minimax-concave penalty. Transportation Research Part C Emerging Technologies. 164. 104657–104657. 2 indexed citations

Lü, Changhong, et al.. (2024). The problem of path decomposition for graphs with treewidth at most 4. Discrete Mathematics. 347(6). 113957–113957.

Lü, Changhong, et al.. (2024). Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm. Entropy. 26(12). 1057–1057.

Lin, Shaohui, et al.. (2023). Explicit Invariant Feature Induced Cross-Domain Crowd Counting. Proceedings of the AAAI Conference on Artificial Intelligence. 37(1). 259–267. 3 indexed citations

Lü, Changhong, et al.. (2021). The Maximum Number of Copies of $K_{r,s}$ in Graphs Without Long Cycles or Paths. The Electronic Journal of Combinatorics. 28(4). 3 indexed citations

Lü, Changhong & Ping Zhang. (2019). Connectivity keeping trees in 2-connected graphs. Discrete Mathematics. 343(2). 111677–111677. 12 indexed citations

Lü, Changhong, et al.. (2018). Paired-domination in claw-free graphs with minimum degree at least three. Discrete Applied Mathematics. 257. 250–259. 3 indexed citations

Yuan, Fei, You Zhou, Meng Wang, et al.. (2015). Identifying New Candidate Genes and Chemicals Related to Prostate Cancer Using a Hybrid Network and Shortest Path Approach. Computational and Mathematical Methods in Medicine. 2015. 1–12. 7 indexed citations

10.

Lü, Changhong & Qing Zhou. (2013). Path covering number and L(2,1)-labeling number of graphs. Discrete Applied Mathematics. 161(13-14). 2062–2074. 3 indexed citations

11.

Chen, Lei, Weiming Zeng, & Changhong Lü. (2012). NP-completeness and APX-completeness of restrained domination in graphs. Theoretical Computer Science. 448. 1–8. 5 indexed citations

12.

Lü, Changhong, et al.. (2009). The Upper and Lower Geodetic Numbers of Graphs.. Ars Combinatoria. 91. 1 indexed citations

13.

Chen, Lei, Changhong Lü, & Zhenbing Zeng. (2009). Distance paired-domination problems on subclasses of chordal graphs. Theoretical Computer Science. 410(47-49). 5072–5081. 3 indexed citations

14.

Chang, Gerard J., Changhong Lü, & Sanming Zhou. (2009). Distance-two labellings of Hamming graphs. Discrete Applied Mathematics. 157(8). 1896–1904. 8 indexed citations

15.

Cheng, Yukun, Liying Kang, & Changhong Lü. (2009). The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers. Theoretical Computer Science. 411(7-9). 1038–1044. 4 indexed citations

16.

Chen, Lei, Changhong Lü, & Zhenbing Zeng. (2009). Hardness results and approximation algorithms for (weighted) paired-domination in graphs. Theoretical Computer Science. 410(47-49). 5063–5071. 11 indexed citations

17.

Chang, Gerard J., Changhong Lü, & Sanming Zhou. (2006). No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups. Discrete Mathematics. 307(14). 1808–1817. 8 indexed citations

18.

Chang, Gerard J. & Changhong Lü. (2003). Distance-two labelings of graphs. European Journal of Combinatorics. 24(1). 53–58. 52 indexed citations

19.

Lü, Changhong & Kemin Zhang. (2002). ON CONTAINER LENGTH AND WIDE-DIAMETER IN UNIDIRECTIONAL HYPERCUBES. Taiwanese Journal of Mathematics. 6(1). 75–87. 4 indexed citations

20.

Lü, Changhong, et al.. (2002). ON $(d,2)$-DOMINATING NUMBERS OF BUTTERFLY NETWORKS$^{*\dagger}$. Taiwanese Journal of Mathematics. 6(4). 515–521. 1 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