Home >> People >> Faculty >>
Lu, Changhong ( 吕长虹 ) 
Title: Professor
Department: Applied Mathematics
Office: Room 231, Math Building
Telephone: 54342646-231
Email: chlu@math.ecnu.edu.cn
Homepage: http://math.ecnu.edu.cn/~chlu
Homepage2: https://faculty.ecnu.edu.cn/_s42/lzh2/main.psp
Research Interest
Combinatorics; Graph Theory and Algorithms
Resume
cv

个人简历:
1991.9-1995.6 湖南师范大学数学系获学士学位;
1995.9-1997.6 东南大学应用数学系, 获硕士学位;
1997.9-2000.6 南京大学数学系,获博士学位;
2000.7-2001.2 湖南师范大学数学系讲师;
2001.3-2001.8 台湾交通大学应用数学系,从事博士后研究;
2001.9-2002.10 台湾大学数学系,从事博士后研究;
2002.11-2003.4 湖南师范大学数学系讲师;
2003.5-2009.12 华东师范大学数学系副教授;
2010-至今 华东师范大学数学系教授


研究方向:
图论及离散算法;运筹学


所获荣誉:
入选2010年教育部新世纪优秀人才计划;2008年上海市高校优秀青年教师;2006年校实践创新优秀指导教师


对学生要求:
1、热爱数学,立志从事图论和离散算法方面研究(要求硕博连读或打算出国深造);
2、立志从事物流和IT行业、热爱数学实际应用(要求会C++或Java编程,对算法有所接触)。
3、非上述两类学生请勿打扰。

Selected Publications
新网页 3

发表的主要论文:
1. On (d,2)-dominating numbers of binary undirected de Bruiijn graphs,Disc. Appl. Math. 105(2000),137-145. (with J. Xu, K. Zhang)
2. On container length and wide diameter in unidirectional hypercube,Taiwanese J. of Math. 6(2002),75-87. (with K. Zhang)
3. On (d,2)-dominating numbers of butterfly networks,Taiwanese J. Math. 6(2002),515-521. (with R. Shao, K. Zhang)
4. Distance two labelings of graphs,European J. Combinatorics 24 (2003),53-58. (with G.Chang)
5. The geodetic numbers of graphs and digraphs,Science in China A:Mathematics 50(2007),1163-1172.
6. Extremal problems on consecutive L(2,1)-labellings,Disc. Appl. Math 155(2007),1302-1313. (with L. Chen, M. Zhai)
7. An extremal problem on non-full colorable graphs,Disc. Appl. Math 155(2007),2165-2173. (with M. Zhai)
8. No-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups,Disc. Math 307(2007),1808-1817. (with G. Chang, S. Zhou)
9. Labelling algorithms for paired-domination problems in block and interval graphs, J. Comb. Optim. 19(2010),457-470. (with L. Chen, Z. Zeng)
10. The upper and Lower geodetic numbers of graphs,Ars Comb. 91(2009),401-409. (with L. Dong, X. Wang)
11. Distance-two labellings of Hamming graphs,Disc. Appl. Math 157(2009),1896-1904. (with G. Chang, S. Zhou)
12. Hardness results and approximation algorithms of (weighted) paired-domination in graphs, Theoretical Computer Science 410 (2009), 5063-5071. (with L. Chen, Z. Zeng)
13. Distance paired-domination problems on subclasses of chordal graphs,Theoretical Computer Science 410 (2009) ,5072-5081. (with L. Chen, Z. Zeng)
14. A linear-time algorithm for paired-domination problem in strongly chordal graphs, Information Processing Letters 110(2009),20-23. (with L. Chen, Z. Zeng)
15. Vertex-coloring edge-weightings of graphs, Taiwanese J. of Math. 159(2011),1807-1813.(with G. Chang, J. Wu, Q. Yu)
16.The L(2,1)-F-labeling problem of graphs, Taiwanese J. of Math. 159(2011), 1277-1285. (with G. Chang)
17. Identifying codes and locating-dominating sets on paths and cycles, Disc. Appl. Math 159(2011),1540-1547. (with C. Chen, Z. Miao)
18. A conjecture on the number of SDRs of a (t, n)-family, European J. Combinatorics 33(2012),1-7.(with D.He)
19. Vertices in all minimum paired-dominating sets of block graphs, Journal of Combinatorial Optimization 24(2012), 176-191. (with L. Chen, Z. Zeng)
20. NP-completeness and APX-completeness of restrained domination in graphs, Theoretical Computer Science 448 (2012),1-8. (with L. Chen, W. Zeng)
21. Three conjectures on the signed cycle domination in graphs, Journal of Combinatorial Optimization 25 (2013), 639-645. (with J. Guan, X. Liu, Z. Miao)
22. Path covering number and L(2,1)-labeling number of graphs, to appear in Discrete Applied Mathematics (with Q. Zhou)


主持的科研项目:
1. 图的标号问题与网络可靠性的图论研究,国家自然科学基金(No.10301010),2004.1---2006.12;
2. 图的标号问题与子图存在性的理论和算法研究,国家自然科学基金(No.60673048),2007.1--2009.12;
3. 图的染色和控制集问题的理论和算法研究,国家自然科学基金(No.10971248),2010.1--2012.12;
4. 超图的2-可染色性和图的控制集问题研究,国家自然科学基金(No.11371008),2014.1---2017.12;
5. 自动发箱和设备自动调度的数学模型,上海浦东国际集装箱码头有限公司,2006.11-2007.12;
6. 集团级多港口协同调度和集成资源配置平台,上海东源计算机自动化工程有限公司,2014.1-2015.12;

 

Recent Publications(From MathSciNet)
MR4976662 Pending Gao, Zhipeng; Li, Ping; Lu, Changhong; Sun, Rui; Yuan, Long-Tu The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two. Discrete Math. 349 (2026), no. 3, Paper No. 114859, 12 pp. 05C35 (05C69)
Publication Year 2026 Indexed 2025-12-30
MR4939448 Reviewed Wei, Meiqin; Fan, Bohua; Lu, Changhong; Yue, Jun; Liu, Jinfeng The edge metric dimensions of convex polytopes. Discrete Appl. Math. 378 (2026), 294–306. (Reviewer: Iztok Peterin) 05C12 (52B10)
Publication Year 2026 Indexed 2025-09-19 Review Published2026-01-30
MR4996224 Reviewed Chen, Wanfang; Lu, Changhong; Yuan, Long-Tu A stability theorem for multi-partite graphs. Combin. Probab. Comput. 34 (2025), no. 6, 821–847. (Reviewer: Nikolaos Fountoulakis) 05C35
Publication Year 2025 Indexed 2026-02-02 Review Published2026-06-01
MR4968302 Pending Chen, Wanfang; Lu, Changhong; Yang, Jia-Bao; Yuan, Long-Tu Proof of a conjecture of Xiao and Zamora. Graphs Combin. 41 (2025), no. 6, Paper No. 114, 7 pp. 05C35
Publication Year 2025 Indexed 2025-12-02
MR4919082 Reviewed Chen, Wanfang; Lu, Changhong; Wu, Qi; Yuan, Long-Tu Packing of the $k$-power of Hamilton cycles. Discrete Math. 348 (2025), no. 12, Paper No. 114630, 10 pp. (Reviewer: Tayo Charles Adefokun) 05C70 (05C45 05C76)
Publication Year 2025 Indexed 2025-08-04 Review Published2026-02-09
MR4885119 Reviewed Pan, Haoqian; Lu, Changhong QUBO modeling for a spectrum of domination problems. J. Math. 2025, Art. ID 3201094, 12 pp. 90C27 (68Q12 81P68 90C20)
Publication Year 2025 Indexed 2025-05-23 Review Published2025-06-04
MR4863023 Reviewed Zhang, Zhizhen; Lu, Changhong Traffic flow phase transition phenomena based on the kinetic approach. Phys. A 662 (2025), Paper No. 130423, 14 pp. 82C40 (90B20)
Publication Year 2025 Indexed 2025-04-28 Review Published2025-04-30
MR4797264 Reviewed Song, Jialei; Lu, Changhong; Yuan, Long-Tu On the Turán number of edge blow-ups of cliques. SIAM J. Discrete Math. 38 (2024), no. 3, 2429–2446. (Reviewer: W. G. Brown) 05C35
Publication Year 2024 Indexed 2024-11-04 Review Published2025-01-30
MR4715206 Reviewed Lu, Changhong; Yi, Niping The problem of path decomposition for graphs with treewidth at most 4. Discrete Math. 347 (2024), no. 6, Paper No. 113957, 13 pp. (Reviewer: Ali Mohammed Sahal Sahal) 05C75 (05C51)
Publication Year 2024 Indexed 2024-05-06 Review Published2024-09-19
MR4504556 Reviewed Guo, Lifeng; Lu, Changhong; Wu, Guanlin Approximation algorithms for a virtual machine allocation problem with finite types. Inform. Process. Lett. 180 (2023), Paper No. 106339, 7 pp. 68W25 (90C10)
Publication Year 2023 Indexed 2023-01-09 Review Published2023-03-08
MR4490600 Reviewed Lu, Changhong; Ye, Qingjie; Zhu, Chengru Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J. Comb. Optim. 44 (2022), no. 3, 2029–2039. 90C35 (05C69)
Publication Year 2022 Indexed 2022-12-08 Review Published2023-09-01
MR4393993 Reviewed Chen, Hangdi; Lu, Changhong; Ye, Qingjie Generalized power domination in claw-free regular graphs. Graphs Combin. 38 (2022), no. 3, Paper No. 68, 17 pp. (Reviewer: Christina M. Mynhardt) 05C69 (05C75)
Publication Year 2022 Indexed 2022-04-29 Review Published2022-08-17
MR4393992 Reviewed Chen, Wanfang; Lu, Changhong; Yuan, Long-Tu Extremal graphs for two vertex-disjoint copies of a clique. Graphs Combin. 38 (2022), no. 3, Paper No. 67, 5 pp. (Reviewer: J. W. Moon) 05C35 (05C69)
Publication Year 2022 Indexed 2022-04-29 Review Published2022-07-18
MR4391855 Reviewed Chen, Hangdi; Lu, Changhong Roman $\{2\}$-domination problem in graphs. Discuss. Math. Graph Theory 42 (2022), no. 2, 641–660. (Reviewer: Yancai Zhao) 05C69
Publication Year 2022 Indexed 2022-04-07 Review Published2022-08-03
MR4347432 Reviewed Lu, Changhong; Ye, Qingjie A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. Discrete Appl. Math. 309 (2022), 147–159. 05C12
Publication Year 2022 Indexed 2022-01-24 Review Published2022-03-01
MR4328902 Reviewed Lu, Changhong; Yuan, Long-Tu; Zhang, Ping The maximum number of copies of $K_{r,s}$ in graphs without long cycles or paths. Electron. J. Combin. 28 (2021), no. 4, Paper No. 4.4, 15 pp. (Reviewer: Yi Zhang) 05C35 (05C38)
Publication Year 2021 Indexed 2021-12-07 Review Published2022-08-25
MR4183823 Reviewed Hong, Yanmei; Liu, Qinghai; Lu, Changhong; Ye, Qingjie Connectivity keeping caterpillars and spiders in 2-connected graphs. Discrete Math. 344 (2021), no. 3, Paper No. 112236, 4 pp. (Reviewer: Yan Zhao) 05C40 (05C05)
Publication Year 2021 Indexed 2021-02-01 Review Published2021-11-18
MR4175559 Reviewed Lu, Shuxiang; Lü, Changhong; Qin, Tao An algorithm based on makespan lower bound for quay crane schedule problem in container terminals. (Chinese) Oper. Res. Trans. 24 (2020), no. 3, 67–76. 90B35 (90C29 90C59 90C90)
Publication Year 2020 Indexed 2022-03-02 Review Published2022-03-04
MR4115488 Reviewed Lu, Changhong; Mao, Rui; Wang, Bing Power domination in regular claw-free graphs. Discrete Appl. Math. 284 (2020), 401–415. (Reviewer: Huadong Su) 05C69 (05C75)
Publication Year 2020 Indexed 2020-08-04 Review Published2021-02-09
MR4064917 Reviewed Gu, Shuyang; Shi, Ganquan; Wu, Weili; Lu, Changhong A fast double greedy algorithm for non-monotone DR-submodular function maximization. Discrete Math. Algorithms Appl. 12 (2020), no. 1, 2050007, 11 pp. (Reviewer: Min Li) 90C27
Publication Year 2020 Indexed 2020-06-24 Review Published2020-10-22

More publications