石峰

副教授

计算机学院

中南大学

长沙 410083, 中国


电子邮箱: fengshi [AT] csu [DOT] edu [DOT] cn

中南大学校本部, 升华北楼201室


中南大学计算机理论与软件研究所成员

   个人简介

        石峰现为中南大学计算机学院讲师。
     2011年09月 至 2017年12月, 中南大学计算机科学与技术专业博士学位, 导师 陈建二 教授 及 王建新 教授。
2015年10月 至 2017年10月, 赴澳大利亚 阿德莱德大学 Optimisation and Logistics研究小组进行访问, 指导老师 Frank Neumann 教授。
2007年09月 至 2011年07月, 中南大学计算机科学与技术专业学士学位。

   研究领域

学生如果研究生期间对如下研究领域感兴趣,请与我联系。
  • Graph Neural Network (Deep Learning)
  • Algorithm Analysis and Design
  • Approximation Algorithm
  • Fixed-parameter Algorithm
  • Evolutionary Algorithm
  • Combinatorial Optimization
  • Bioinformatics

   科研项目(负责人)

  • 系统发生网络难解问题核心化与参数算法研究, NSFC, 2019-2021

   论文成果

    期刊文献

  • Feng Shi, Hangcheng Li, Guozhen Rong, Zhen Zhang, Jianxin Wang: Improved Fixed-parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10.1109/TCBB.2021.3111660. (CCF B)
  • Feng Shi, Frank Neumann, Jianxin Wang: Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem, Theoretical Computer Science, https://doi.org/10.1016/j.tcs.2021.09.003 (CCF B)
  • Feng Shi, Jie You, Zhen Zhang, Jingyi Liu, Jianxin Wang: Fixed-parameter tractability for the Tree Assembly problem. Theoretical Computer Science 886:3-12 (2021) (CCF B)
  • Zhen Zhang, Yutian Guo, Junyu Huang, Jianxin Wang, Feng Shi*: Improved approximation for prize-collecting red-blue median. Theoretical Computer Science 878-879:67-82 (2021) (CCF B)
  • Feng Shi, Frank Neumann, Jianxin Wang: Runtime Performances of Randomized Search Heuristics for the Dynamic Weighted Vertex Cover Problem. Algorithmica 83:906-939 (2021) (CCF B)
  • Jie You, Feng Shi, Jianxin Wang, Qilong Feng: Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition. Theoretical Computer Science 806: 256-270 (2020) (CCF B)
  • Mojgan Pourhassan, Feng Shi, Frank Neumann: Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem. Evolutionary Computation 27(4): 559-575 (2019) (CCF B)
  • Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann: Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints. Algorithmica 81(2): 828-857 (2019) (CCF B)
  • Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang: A parameterized algorithm for the Maximum Agreement Forest problem on multiple rooted multifurcating trees. Journal of Computer and System Sciences 97: 28-44 (2018) (CCF B)
  • Jianer Chen, Feng Shi, Jianxin Wang: Approximating Maximum Agreement Forest on Multiple Binary Trees, Algorithmica 76(4): 867-889 (2016) (CCF B)
  • Feng Shi, Qilong Feng, Jie You, Jianxin Wang: Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees, Journal of Combinatorial Optimization 32(1): 111-143 (2016)
  • Feng Shi, Jianxin Wang, Yufei Yang, Qilong Feng, Weilong Li, Jianer Chen: A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees. SCIENCE CHINA Information Sciences 59(1): 1-14 (2016) (CCF B)
  • Jie You, Jianxin Wang, Qilong Feng, Feng Shi: Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. Theoretical Computer Science 607: 257-270 (2015) (CCF B)
  • Jianxin Wang, Weimin Su, Min Yang, Jiong Guo, Qilong Feng, Feng Shi, Jianer Chen: Parameterized complexity of control and bribery for d-approval elections. Theoretical Computer Science 595: 82-91 (2015) (CCF B)
  • Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo: Algorithms for parameterized maximum agreement forest problem on multiple trees. Theoretical Computer Science 554: 207-216 (2014) (CCF B)
  • Feng Shi, Qilong Feng, Jianer Chen, Lusheng Wang, Jianxin Wang: Distances Between Phylogenetic Trees: A Survey. Tsinghua Science and Technology 18(5): 490-499 (2013)
  • 会议文章

  • Feng Shi, Jie You, Zhen Zhang, Jingyi Liu: Tractabilities for Tree Assembly Problems. TAMC 2020: 300-312
  • Feng Shi, Frank Neumann, Jianxin Wang: Runtime analysis of evolutionary algorithms for the depth restricted (1, 2)-minimum spanning tree problem. FOGA 2019: 133-146
  • Qilong Feng, Zhen Zhang, Feng Shi, Jianxin Wang: An Improved Approximation Algorithm for the k-Means Problem with Penalties. FAW 2019: 170-181
  • Feng Shi, Frank Neumann, Jianxin Wang: Runtime analysis of randomized search heuristics for the dynamic weighted vertex cover problem. GECCO 2018: 1515-1522 (CCF C)
  • Feng Shi, Martin Schirneck, Tobias Friedrich, Timo Kötzing, Frank Neumann: Reoptimization times of evolutionary algorithms on linear functions under dynamic uniform constraints. GECCO 2017: 1407-1414 (CCF C)
  • Mojgan Pourhassan, Feng Shi, Frank Neumann: Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem. PPSN 2016: 729-739 (CCF B)
  • Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang: Approximation Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2014: 381-392
  • Feng Shi, Jie You, Qilong Feng: Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. FAW 2014: 205-215
  • Jie You, Qilong Feng, Jiong Guo, Feng Shi: On Star-Cover and Path-Cover of a Tree. FAW 2014: 298-308
  • Feng Shi, Jianer Chen, Qilong Feng, Jianxin Wang: Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees. COCOON 2013: 567-578

   专业服务

    会议程序委员会成员

  • GECCO 2022 (Theory Track)
  • GECCO 2021 (Theory Track)
  • IJCAI-PRICAI 2020
  • GECCO 2020 (Theory Track)
  • ICPCSEE 2019
  • GECCO 2017 (Student Workshop)
  • 期刊审稿

  • Journal of Computer and System Sciences
  • Algorithmica
  • Theoretical Computer Science
  • Journal of Combinatorial Optimization
  • 会议审稿

  • GECCO 2022,2021,2020,2019,2018,2017
  • ISBRA 2019
  • SODA 2016, 2018
  • WADS 2015
  • WG 2015

   教学活动

  • 2021秋, 算法分析与设计 (本科生)
  • 2021秋, 人工智能 (研究生及博士生,英语授课)
  • 2021春, 数据结构 (本科生)
  • 2020秋, C语言 (本科生)
  • 2020秋, 人工智能 (研究生及博士生,英语授课)
  • 2020春, 人工智能 (研究生及博士生,英语授课)
  • 2019春, 人工智能 (研究生及博士生,英语授课)