吴吉昌，1973年生；副教授、研究生导师。
学习经历
2009.7，荷兰屯特（University of Twente）大学，博士学位
2003.12， 西北工业大学，博士学位
2000.7，广西师范大学，硕士学位
1997.7，山东大学，学士学位
项目
2009—2011，国家自然科学基金青年科学基金项目（10801091）连通图的可去边，可收缩边与条件连通性理论。（主持）
2007-2009，国家自然科学基金面上项目（60673059）DNA数据挖掘中的组合理论与算法设计。（参与）
2012-2015，国家自然科学基金（11161035）图上点不相子图的存在性研究。（参与）
发表论文
1.J. Wu, X. Li, Removable Edges in Longest Cycles of 4-Connected Graphs, Graphs & Combin (2004)20:413-422
2.J. Wu, X. Li and L. Wang, Removable Edges in a Cycle of a 4-Connected Graph, Discrete Mathematics 287(2004), 103-111.
3.J. Wu, X. Li and J. Su, The Number of Removable Edges in 4-connected Graphs, Journal of Combin.Theory Ser.B, 92 (2004), 13-40.
4.X. Qi, G. Li, J. Wu, B. Liu, Sorting Signed Permutations by Fixed-Length Reversals, INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2006, VOL 17; NUMB 4, pages 933-948
5.H. Kang, J. Wu, G. Li, Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs, Lecture Notes in Computer Science, 2007, Volume 4613/2007, 337-345.
6.H. Kang, J. Wu, G. Li, Removable edges of cycles in 5-connected graphs, Journal of Applied Mathematics and Computing, Volume 28, Numbers 1-2, 93-106.
7.X. Qi, J. Wu, S. Li, G. Li, Sorting by transpositions: dealing with length-weighted models, Int. J Bioinform Res Appl. 2008: 4(2):164-171.
8.J. Ou, X. Chen, J Wu, On 3-restricted edge connectivity of undirected binary Kautz graphs. Discrete Mathematics 309(4): 629-638 (2009)
请记住我们的网址：www.js-zs.org
（责任编辑：admin）
