1、個(gè)人基本信息：

姓  名：李文軍

性  別：男

出生年月：1982年08月

技術(shù)職稱：教授

畢業(yè)院校：中南大學(xué)

學(xué)歷（學(xué)位）：博士

所在學(xué)科： 計(jì)算機(jī)科學(xué)與技術(shù)

研究方向：計(jì)算機(jī)算法、人工智能、

2、教育背景：

1999.9-2003.7

湘潭大學(xué)

學(xué)士

2007.9-2010.7

中南大學(xué)

碩士

2010.9-2014.12

中南大學(xué)

博士

2011.10-2012.10

美國Texas A&M University

聯(lián)培

3、目前研究領(lǐng)域：

計(jì)算機(jī)算法優(yōu)化、人工智能

4、已完成或已在承擔(dān)的主要課題：

主持或主持完成國家自然科學(xué)基金項(xiàng)目3項(xiàng)、教育部科技發(fā)展中心新一代信息技術(shù)重點(diǎn)項(xiàng)目1項(xiàng)、湖南省自然科學(xué)基金青年項(xiàng)目2項(xiàng)、湖南省教育廳自然科學(xué)基金2項(xiàng)。此外，作為校內(nèi)主持人與校外合作者聯(lián)合申請并獲批國家自然科學(xué)基金項(xiàng)目3項(xiàng)。明細(xì)如下：

1. 國家自然科學(xué)基金面上項(xiàng)目：面向NP難問題多種求解算法的皇冠分解技術(shù)研究 (62372066，項(xiàng)目經(jīng)費(fèi)50萬元. 研究時(shí)限為2024.01-2027.12)。

2. 國家自然科學(xué)基金面上項(xiàng)目：基于深層局部搜索的核心化技術(shù)研究 (61872048，項(xiàng)目經(jīng)費(fèi)63萬元. 研究時(shí)限為2019.01-2022.12)。  

3. 國家自然科學(xué)青年基金項(xiàng)目：基于核心化技術(shù)的FPT算法研究 (61502054，項(xiàng)目經(jīng)費(fèi)20萬元. 研究時(shí)限為2016.01-2018.12)。

4. 國家自然科學(xué)基金面上項(xiàng)目（合作申請，校內(nèi)主持）：邊編輯問題的參數(shù)復(fù)雜性（62372394，項(xiàng)目經(jīng)費(fèi)10萬元. 研究時(shí)限為2024.01-2027.12）

5. 國家自然科學(xué)基金面上項(xiàng)目（合作申請，校內(nèi)主持）：弦圖及相關(guān)圖類的算法研究（61972330，項(xiàng)目經(jīng)費(fèi)9.8萬元. 研究時(shí)限為2020.01-2013.12）

6. 國家自然科學(xué)青年基金項(xiàng)目（合作申請，校內(nèi)主持）：投票問題在限定偏好集上的參數(shù)復(fù)雜性研究 （61702557，項(xiàng)目經(jīng)費(fèi)5.2萬元. 研究時(shí)限為2018.01-2020.12）

7. 湖南省自然科學(xué)基金面上項(xiàng)目：基于非確定性結(jié)構(gòu)的皇冠分解技術(shù)研究（2022JJ30620，項(xiàng)目經(jīng)費(fèi)5萬元，研究時(shí)限為2022.01-2024.12）。

8. 湖南省教育廳優(yōu)秀青年項(xiàng)目：大規(guī)模WSN中計(jì)算難解問題的近似算法研究（21B0305，項(xiàng)目經(jīng)費(fèi)7萬元，研究時(shí)限為2022.01-2024.12）。

9. 新一代信息技術(shù)創(chuàng)新重點(diǎn)項(xiàng)目：基于區(qū)塊鏈的高?？蒲性u價(jià)系統(tǒng)（2020ITA09004，項(xiàng)目經(jīng)費(fèi)5萬元，研究時(shí)限為2022.09-2022.08）。

10. 湖南省自然科學(xué)青年基金項(xiàng)目：大數(shù)據(jù)時(shí)代WSN中NP難解問題的核心化算法研究（2017JJ3333， 項(xiàng)目經(jīng)費(fèi)5萬元，研究時(shí)限為2017.01-2019.12）。

11. 湖南省教育廳一般項(xiàng)目：參數(shù)計(jì)算中核心化技術(shù)研究 （17C0047， 項(xiàng)目經(jīng)費(fèi)1萬元，研究時(shí)限為2017.09-2019.08）。

12. 軍工保密項(xiàng)目子課題：***自動(dòng)修復(fù)研究（項(xiàng)目經(jīng)費(fèi)20萬元，研究時(shí)限為2013.01-2024.12）

5、已發(fā)表的學(xué)術(shù)論文：

[1] Wenjun Li, Huan Peng, Yongjie Yang. Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations. Theoretical Computer Science,2022, 906: 83–93.

[2] Wenjun Li, Chao Xu, Yongjie Yang, Jianer Chen, Jianxin Wang. A refined branching algorithm for the maximum satisfiability problem. Algorithmica, 2022, vol 84, pp. 982–1006.

[3] WenjunLi, Junjie Ye, Yixin Cao. A 5k-vertex kernel for P₂-packing. Theoretical Computer Science, 2022, 910: 1–13.

[4] Wenjun Li, Siyang Zhang, Guangwei Wu, Aldosary Saad, Amr Tolba, and Gwang-jun Kim. A sustainable WSN system with heuristic schemes in IIoT. CMC-Computers,Materials & Continua, 2022, Vol.72, No.3, pp.4215-4231.

[5] Wenjun?Li, Xiaojing Tang, Yongjie Yang: An improved branching algorithm for the proper interval edge deletion problem. Frontiers of Computer Science, 2022,?16(2): 162401.

[6] Guozhen Rong, Yongjie Yang, Wenjun Li. A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs[C]// International Symposium on Mathematical Foundations of Computer Science (MFCS), 2023, 77:1-77:15

[7] Guozhen Rong, Wenjun Li, Jianxin Wang. AND YONGJIE YANG. Cycle extendability of hamiltonian strongly chordal graphs. SIAM Journal on Discrete Mathematics. 2021, Vol. 35, No. 3, pp. 2115--2128.

[8] Wenjun Li, Yang Ding, Yongjie Yang, Guozhen Rong: A (2?+??)k-vertex kernel for the dual coloring problem. Theoretical Computer Science,?2021, 868: 6-11.

[9] Wenjun Li, Yang Ding,  Yongjie Yang, et al. Parameterized algorithms of fundamental NP-hard problems: a survey. Human-Centric Computing and Information Sciences, 10, 29(2020). DOI: 10.1186/s13673-020 -00226-w.

[10] Wenjun Li, Huayi Xu, Huixi Li, Yongjie Yang, Pradip Kumar Sharma, Jin Wang, and Saurabh Singh. Complexity and Algorithms for Superposed Data Uploading Problem in Networks with Smart Devices. IEEE Internet of Things Journal,7(7), 2020, pp. 5882 - 5891.

[11] Wenjun Li; Zhenyu Chen; Xingyu Gao; Wei Liu; Jin Wang. MultiModel Framework for Indoor Localization under Mobile Edge Computing Environment.IEEE Internet of Things Journal, 6(3) ,2019, pp. 4844 - 4853.

[12] Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang. An Improved Linear Kernel for Complementary Maximal Strip Recovery: Simpler and Smaller[J]. Theoretical Computer Science, 2019, 786:55-66.

[13] Wenjun Li, Binhai Zhu. A 2k-kernelization algorithm for vertex cover based on crown decomposition[J]. Theoretical Computer Science. 2018, 739: 80-85.

[14] Wenjun Li, Jianxin Wang, Jianer Chen, Yinxin Cao. Deeper Local Search for Parameterized and Approximation Algorithms for Maximum Internal Spanning Tree[J]. Information and Computation, 2017, 252: 187-200

[15] Wenjun Li, Qilong Feng, Jianer Chen, Shuai Hu. Improved kernel results for some FPT problems based on simple observations[J]. Theoretical Computer Science, 2017, 657: 20-27

[16] Wenjun Li, Jianxin Wang, Yongjie Yang. Improved Kernels and Algorithms for Claw and Diamond Free Edge Deletion Based on Refined Observations. 2017, https://arxiv.org/abs/1707.06779.

[17] Wenjun Li, Yongjie Yang, Jianer Chen, Jianxin Wang. Further Kernelization of Proper Interval Vertex Deletion: New Observations and Refined Analysis, 2016, https://arxiv.org/abs/1606.01925.

[18] Jianxin Wang, Wenjun Li, Jianer Chen. A Parameterized Algorithm for the Hyperplane-Cover problem[J]. Theoretical Computer Science, 2010, 411: 4005-4009.

[19] Jianxin Wang, Wenjun Li, Jianer Chen. On the Parameterized Vertex Cover Problem for Graphs with Perfect Matching[J]. SCIENCE CHINA Information Sciences, 2014, 57(7): 1-12.

[20] Wenjun Li, Jianer Chen, Jianxin Wang. Deeper Local Search for better Approximation on Maximum Internal Spanning Trees[C]// European Symposium on Algorithms (ESA), 2014, 8737: 642-653.

[21] Wenjun Li, Jianxin Wang, Jianer Chen, Yinxin Cao. A 2k-Vertex Kernel for Maximum Internal Spanning Tree[C]// Algorithms and Data Structures Symposium (WADS), 2015, 9214: 495-505.

[22] Wenjun Li, Shuai Hu. Smaller kernels for several FPT problems based on simple observations[C]// International Frontiers of Algorithmics Workshop (FAW), 2015, 9130: 170-179

[23] Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang. A 42k Kernel for the Complementary Maximal Strip Recovery Problem[C]// International Frontiers of Algorithmics Workshop (FAW), 2017，175-186.

[24] Wenjun Li, Jianxin Wang, Chao Xu, and Yongjie Yang. An Improved Branching Algorithm for (n, 3)-MaxSAT Based on Refined Observations. COCOA 2017, 2017.

[25] Wenjun Li, Junjie Ye and Yixin Cao. Kernelization for P2-packing: A Gerrymandering Approach[C]// International Frontiers of Algorithmics Workshop (FAW), 2018. pp: 140-153.

[26] Mugang Lin, Qilong Feng, Jianer Chen. Wenjun Li. Partition on trees with supply and demand: Kernelization and algorithms[J]. Theoretical Computer Science, 2017, 657: 11-19

[27] Qilong Feng, Qian Zhou, Wenjun Li, Jianxin Wang. Kernelization in Parameterized Computation: A Survey[J]. Tsinghua Science and Technology, 2014, 19(4): 338-345

[28] Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo. Kernelization of Two Path Searching Problems on Split Graphs[C]// International Frontiers of Algorithmics Workshop (FAW), 2016, 238-249.

[29] Shuai Hu, Wenjun Li. An Improved Kernel for the Complementary Maximal Strip Recovery Problem [C]// International Computing and Combinatorics Conference (COCOON), 2015, 9198: 601-608.

[30] Mugang Lin, Wenjun Li, Qilong Feng. Parameterized Minimum Cost Partition of a Tree with Supply and Demand [C]// International Frontiers of Algorithmics Workshop (FAW), 2015, 9130: 180-189.

[31] Yongjie Yang, Yash Raj Shrestha, Wenjun Li, Jiong Guo. On the Kernelization of Split Graph Problems. Theoretical Computer Science. 2018, 734:72-82..

[32] Huixi Li, Wenjun Li, Qilong Feng, Shigeng Zhang, Haodong Wang, Jianxin Wang. Leveraging content similarity among VMI files to allocate virtual machines in cloud[J]. Future Generation Computer Systems, 2018, 79: 528-542.

[33] Huixi Li, Wenjun Li, Haodong Wang, Jianxin Wang. An Optimization of Virtual Machine Selection and Placement by Using Memory Content Similarity for Server Consolidation in Cloud [J]. Future Generation Computer Systems, 2018, 84:98-107.

[34] href="#!" Huixi Li, Wenjun Li, Shigeng Zhang, HaodongWang, Yi Pan, JianxinWang, Page-sharing-based virtual machine packing with multi-resource constraints to reduce network traffic in migration for clouds. Future Generation Computer Systems, Volume 96, July 2019, Pages 462-471.

[35] Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang. An Improved Algorithm for the (n, 3)-MaxSAT problem: Asking Branchings to Satisfy the Clauses. Journal of Combinatorial Optimization (JOCO). 2019, Accepted.

[36] Guozhen Rong, Wenjun Li, Yongjie Yang, Jianxin Wang: Reconstruction and verification of chordal graphs with a distance oracle. Theor. Comput. Sci.?859: 48-56 (2021)

[37] Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang: Cycle Extendability of Hamiltonian Strongly Chordal Graphs. SIAM J. Discret. Math.?35(3): 2115-2128 (2021)

[38] Chao Xu, Wenjun Li, Jianxin Wang, Yongjie Yang: An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses. J. Comb. Optim.?42(3): 524-542 (2021)

6、已授權(quán)發(fā)明專利

(1) 發(fā)明專利：李文軍、張思楊、張經(jīng)宇等. 基于啟發(fā)式算法的可持續(xù)無線傳感器網(wǎng)絡(luò)系統(tǒng)構(gòu)建方法. ZL 2021 1 0755857.4. 2023年4月25日.

(2) 發(fā)明專利：李文軍、徐華奕、丁洋等. 一種數(shù)據(jù)傳輸網(wǎng)的建立方法、系統(tǒng)及相關(guān)裝置. ZL 2019 1 0816606.5. 2023年4月25日

7、所獲學(xué)術(shù)榮譽(yù)及學(xué)術(shù)影響

1、 中國計(jì)算機(jī)學(xué)會(huì)（CCF）理論計(jì)算機(jī)科學(xué)專委會(huì)委員；

2、 中國人工智能學(xué)會(huì)（CAAI）智慧醫(yī)療專委會(huì)委員；

3、 湖南省計(jì)算機(jī)學(xué)會(huì)理事；

4、 湖南省人工智能學(xué)會(huì)理事；

6、湖南省計(jì)算機(jī)學(xué)會(huì)機(jī)器視覺與醫(yī)學(xué)影像專委會(huì)委員。