洪艳梅
 
基本信息
职称 副教授
职务 硕士生导师
主讲课程
研究方向 图论与组合最优化
办公室 数计学院4号楼120
电子邮件
联系电话
个人简介

洪艳梅,博士,福州大学数学与计算机科学学院副教授,硕士生导师。主要研究领域为图论与组合最优化。主持国家自然科学基金两项,参与国家自然科学基金两项,在Journal of Graph Theory等SCI学术期刊上发表学术论文20篇。

教育经历
  1. 2000.09 - 2004.06,新疆师范大学,数学与系统科学学院,学士
  2. 2006.09-2009.06,  新疆大学, 数学与系统科学学院,硕士
  3. 2009.09-2012.06, 上海大学,理学院数学系,博士
海外经历
  1. 2010.08 - 2011.09,美国佐治亚理工学院,联合培养博士
  2. 2018.01 - 2018.07,美国佐治亚理工学院,访问学者
获奖情况
  1. 2018年,“Non-separating cycles avoiding specific vertices” 获 十三届福建省自然科学优秀论文一等奖.
科研项目
  1. 有向超欧拉图及相关问题研究(11401103),国家自然科学基金青年项目,2015.01-2017.12 ,主持
  2. 有向超欧拉图的度条件及相关问题研究(11326214),国家自然科学基金天元基金项, 2014.01-2014.12,主持
  3. 可去子图及相关问题研究(2018J01665), 福建省自然科学基金,2018.04 -- 2021.03, 主持
  4. 两类与嵌入树相关的猜想的研究(11871015), 国家自然科学基金项目面上项目, 2019.01 -- 2022.12, 参与
  5. 图与超图若干划分问题的研究(11671087), 国家自然科学基金项目面上项目, 2017.01 -- 2020.12, 参与
主要论著
  1. Shengjin Ji, Yanmei Hong, Mengmeng Liu, The Lower Bound of Revised Szeged Index with Respect to Tricyclic Graphs, MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 79(2018)3:757-778. (SCI)

  2. Yanmei Hong, Qinghai Liu, Hong-Jian Lai, Characterization of Digraphic Sequences with Strongly Connected Realizations, Journal of Graph Theory, 84 (2017) 2:191-201 (SCI)

  3. Yanmei Hong, Qinghai Liu, Degree sequence for k-arc strongly connected multiple digraphs, Journal of Inequalities and Applications 2017(1) (SCI)

  4. Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu, Fractional spanning tree packing, forest covering and eigenvalues, Discrete Applied Mathematics 213 (2016) 219–223 (SCI)

  5. Yanmei Hong, Qinghai Liu, Hong-Jian Lai, Ore-type degree condition of supereulerian digraphs, Discrete Mathematics 339 (2016) 8:2042-2050 (SCI)

  6. Yanmei Hong, Realizability of Fault-Tolerant Graphs, BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 39 (2016) 2:619-63 (SCI)

  7. Yanmei Hong*, Liying Kang and Xingxing Yu, Non-separating cycles avoiding specific vertices, Journal of Graph Theory, 1 80(2015): 253–267. (SCI)

  8. Fan Genghua, Yanmei Hong* and Qinghai Liu, Ore’s condition for completely independent spanning trees,Discrete Applied Mathematics, 177(2014) 95-100.  (SCI)
  9. Yanmei Hong*,Hongjian Lai and Qinghai Liu,Supereulerian digraphs, Discrete Mathematics, 330(2014) 87-95. (SCI)
  10. Qinghai Liu, Yanmei Hong* and Hongjian Lai, Edge-disjoint spanning trees and eigenvalue, Linear Algebra and its Applications458(2014) 108-133.  (SCI)
  11. Qinghai Liu, Yanmei Hong*, Xiaofeng Gu, Hong-Jian Lai,Note on edge-disjoint spanning trees andeigenvalues,Linear Algebra and its Applications444(2014) 146-151.  (SCI)
  12. Yanmei Hong* and Hongjian Lai, Non-separating subgraphs, Discrete Mathematics, 313(4) 391-396, 2013. (SCI)
  13. Qinghai Liu, Zhao Zhang, Yanmei Hong*, Weili Wu and Dingzhu Du, A PTAS for weak minimum routing cost connected dominating set of unit disk graph, Optimization, Simulation, and Control, Springer Optimization and Its Applications, Springer Science+Business Media New York, 2013. Book
  14. Yanmei Hong* and Liying Kang, Backup 2-center on interval graphs. Theoretical Computer Science, 445(3) 25-35, 2012. (SCI)
  15.  Yanmei Hong*, Jixiang Meng and Zhao Zhang, Edge fault tolerance of super edge connectivity of graphs, Discrete Applied Mathematics160(4) 579-587, 2012. (SCI)
  16.  Yanmei Hong* and Zhao Zhang, Vertex fault tolerance of optimal-κ graphs and super-λgraphs, Information Processing Letters109(20) 1151-1155, 2009. (SCI)
  17.  Qinghai Liu, Yanmei Hong* and Zhao Zhang, Minimally 3-restricted edge connected graphs. Discrete Applied Mathematics157(4) 685-690, 2009. (SCI)
  18.  Yanmei Hong*, Zhao Zhang and Qinghai Liu, Edges of degree k in minimally restricted k-edge connected graphs. Discrete Mathematics309(13) 4448-4455, 2009. (SCI)
  19.  Yanmei Hong*, Qinghai Liu and Zhao Zhang, Minimally restricted edge connected graphs. Applied Mathematics Letter 21(8) 820-823, 2008. (SCI)