榮國楨
發(fā)布時(shí)間: 2024-02-28 11:45:45 瀏覽量:
長沙理工大學(xué)計(jì)算機(jī)與通信工程學(xué)研究生導(dǎo)師基本信息表 |
|||||||
1、個(gè)人基本信息: |
|||||||
姓 名:榮國楨 |
性 別:男 |
|
|||||
出生年月:1988年9月 |
技術(shù)職稱:講師 |
||||||
畢業(yè)院校:中南大學(xué) |
學(xué)歷(學(xué)位):博士 |
||||||
所在學(xué)科:計(jì)算機(jī)科學(xué)與技術(shù) |
研究方向:數(shù)據(jù)結(jié)構(gòu)與算法、圖論與圖算法、組合優(yōu)化 |
||||||
2、教育背景: |
|||||||
湘潭大學(xué) |
學(xué)士 (計(jì)算機(jī)科學(xué)與技術(shù)) |
||||||
2010.9-2013.6 |
華南師范大學(xué) |
工學(xué)碩士 (計(jì)算機(jī)軟件與理論) |
|||||
2018.9-2022.6 |
中南大學(xué) |
工學(xué)博士 (計(jì)算機(jī)科學(xué)與技術(shù)) |
|||||
3、目前研究領(lǐng)域: |
|||||||
圖論與圖算法、近似算法、參數(shù)算法。 |
|||||||
4、已完成或已在承擔(dān)的主要課題: |
|||||||
(1) 國家自然科學(xué)基金青年項(xiàng)目“弦圖類的團(tuán)圖結(jié)構(gòu)及其應(yīng)用研究”(No. 62302060) 2024.01-2026.12,30萬,主持; (2) 國家自然科學(xué)基金面上項(xiàng)目“面向NP難問題多種求解算法的皇冠分解技術(shù)研究”(No.62372066) 2024.01-2027.12,50萬,參與; (3) 國家自然科學(xué)基金面上項(xiàng)目“并行流水機(jī)調(diào)度問題近似算法研究”(No. 62072476) 2020.11-2024.12,56萬,參與。 |
|||||||
6、已發(fā)表的學(xué)術(shù)論文: |
|||||||
近期發(fā)表的與項(xiàng)目有關(guān)的主要論文包括(其中本人以黑體加以強(qiáng)調(diào),通訊作者以“*”標(biāo)出):期刊論文: [1] Guozhen Rong, Yixin Cao, Jianxin Wang, and Zhifeng Wang, Graph Searches and Their End Vertices. Algorithmica, 2022. 84(9): p. 2642-2666. (CCF-B類期刊) [2] Guozhen Rong, Wenjun Li, Jianxin Wang, Yongjie Yang: Cycle Extendability of Hamiltonian Strongly Chordal Graphs. SIAM J. Discret. Math. 35(3): 2115-2128 (2021) (CCF-C類期刊) [3] Guozhen Rong, Wenjun Li, Yongjie Yang, and Jianxin Wang, Reconstruction and verification of chordal graphs with a distance oracle. Theor. Comput. Sci., 2021. 859: p. 48-56. (CCF-B類期刊) [4] Guozhen Rong, Yongjie Yang, Wenjun Li, and Jianxin Wang, A divide-and-conquer approach for reconstruction of {}-free graphs via betweenness queries. Theor. Comput. Sci., 2022. 917: p. 1-11. (CCF-B類期刊) [5] Wenjun Li, Yang Ding, Yongjie Yang, and Guozhen Rong*, A (2?+??)k-vertex kernel for the dual coloring problem. Theoretical Computer Science, 2021. 868: p. 6-11. (CCF-B類期刊,通訊作者)
會(huì)議論文: [1] Guozhen Rong, Yongjie Yang, and Wenjun Li, A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs, International Symposium on Mathematical Foundations of Computer Science (MFCS), 2023. p. 77:1-77:15. (CCF-C類會(huì)議) [2] Yixin Cao, Zhifeng Wang, Guozhen Rong, and Jianxin Wang, Graph Searches and Their End Vertices. in International Symposium on Algorithms and Computation (ISAAC), 2019. p. 1:1-1:18. (CCF-C類會(huì)議) [3] Yixin Cao, Guozhen Rong*, and Jianxin Wang. Characterization and Linear-Time Recognition of Paired Threshold Graphs. in International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2020. p. 298-309. (理論計(jì)算機(jī)科學(xué)領(lǐng)域國際知名會(huì)議)
|
|||||||
7、 所獲學(xué)術(shù)榮譽(yù)及學(xué)術(shù)影響: |
|||||||
指導(dǎo)研究生獲第二屆湖南省研究生計(jì)算機(jī)創(chuàng)新大賽省級(jí)一等獎(jiǎng) |
聯(lián)系地址:rongguozhen@csust.edu.cn
下一篇:毛宜鈺