博士,副教授、硕士研究生导师。主要研究方向为互连网络与图。现为美国《数学评论》评论员。近年来,主持国家自然科学基金(青年)项目1项,山西省青年科技研究基金面上青年项目1项。在《Applied Mathematics and Computation》、《Discrete Applied Mathematics》、《Theoretical Computer Science》、《International Journal of Computer Mathematics》、《International Journal of Foundations of Computer Science》等国内外重要学术期刊上发表论文10余篇。
国家自然科学基金(No.61070229):网络可靠性参数的优化研究,2011.01-2013.12,(参与);
教育部博士点基金(博导类)(No.20111401110005):网络连通性优化研究,2012.01-2014.12,(参与)。
[1]Kai Feng,Shiying Wang. Strong matching preclusion for two-dimensional torus networks, International Journal of Computer Mathematics, 2014, DOI:10.1080/00207160.2014.913034.
[2]Shiying Wang,Kai Feng. Fault tolerance in the arrangement graphs, Theoretical Computer Science, 2014, 533:64-71.点击阅览
[3]Shiying Wang,Kai Feng. Strong matching preclusion for torus networks, Theoretical Computer Science, 2014, 520:97-110.点击阅览
[4]冯凯,王世英. k元n方体的边容错性, 山西大学学报(自然科学版), 2013, 36(3):389-392.点击阅览
[5]Shiying Wang,Kai Feng,Guozhen Zhang. Strong matching preclusion for k-ary n-cubes, Discrete Applied Mathematics, 2013, 161:3054-3062.点击阅览
[6]冯凯,王世英. 带有条件故障边的k元2方体的圈嵌入, 计算机工程与应用, 2012, 48(5):32-34,40.点击阅览
[7]Shiying Wang,Kai Feng,Shurong Zhang,Jing Li. Embedding long cycles in faulty k-ary 2-cubes, Applied Mathematics and Computation, 2012, 218:5409-5413.点击阅览
[8]Shiying Wang,Guozhen Zhang,Kai Feng. Fault tolerance in k-ary n-cube networks, Theoretical Computer Science, 2012, 460:34-41. 点击阅览