Prof. Dr. Qinghai Liu | Graph Algorithm Awards | Best Researcher Award

Prof. Dr. Qinghai Liu | Graph Algorithm Awards | Best Researcher AwardΒ 

Prof. Dr. Qinghai Liu, Fuzhou University, China

Qinghai Liu is a professor at the School of Mathematics and Statistics at Fuzhou University, China. He earned his Ph.D. in Applied Mathematics from Xinjiang University in 2012, following a Master’s degree in Operations Research and Cybernetics (2009) and a Bachelor’s degree in Mathematics and Applied Mathematics (2005) from the same institution and Zhengzhou University, respectively. He has held various academic positions at Fuzhou University, including Associate Professor and Lecturer, and conducted postdoctoral research at the School of Mathematics, Georgia Institute of Technology (2016–2018). His research focuses on graph theory, combinatorial optimization, and PCB routing algorithms. With numerous publications in high-impact journals, he has contributed significantly to areas such as connectivity in graphs, routing optimization, and algorithmic graph theory.

Professional Profile:

ORCID

Suitability of Qinghai Liu for the Best Researcher Award

Dr. Qinghai Liu is a highly qualified candidate for the Best Researcher Award, given his significant contributions to graph theory, applied mathematics, and optimization algorithms. With a Ph.D. in Applied Mathematics from Xinjiang University (2012) and a professorship at Fuzhou University, he has made notable advancements in discrete mathematics, combinatorial optimization, and circuit routing algorithms.

πŸ“š Education

πŸŽ“ Doctor of Applied Mathematics (2009–2012) – Xinjiang University, Urumqi, China
πŸŽ“ Master of Operations Research and Cybernetics (2006–2009) – Xinjiang University, Urumqi, China
πŸŽ“ Bachelor of Mathematics and Applied Mathematics (2001–2005) – Zhengzhou University, Zhengzhou, China

πŸ‘¨β€πŸ« Work Experience

πŸ… Professor (2022–Present) – School of Mathematics and Statistics, Fuzhou University
πŸ“Š Associate Professor (2021–2021) – School of Mathematics and Statistics, Fuzhou University
πŸ”¬ Postdoctoral Researcher (2016–2018) – School of Mathematics, Georgia Institute of Technology, USA
πŸ“Š Associate Professor (2015–2021) – College of Mathematics and Computer Science, Fuzhou University
πŸ“– Lecturer (2012–2015) – College of Mathematics and Computer Science, Fuzhou University

πŸ† Achievements & Contributions

πŸ“ˆ Published 17+ research papers in top-tier journals and conferences on graph theory, combinatorics, and optimization
πŸ” Research contributions in areas such as Graph Theory, PCB Routing Algorithms, and Discrete Mathematics
πŸ“š Collaborated with leading researchers globally in combinatorial optimization and theoretical computer science

πŸŽ–οΈ Awards & Honors

πŸ† National Science Fund for Distinguished Young Scholars
🌍 Postdoctoral Research Fellowship – Georgia Institute of Technology, USA
πŸ“œ Recognized for Excellence in Research – Fuzhou University
✨ Invited Speaker at International Conferences on Discrete Mathematics and Graph Theory

PublicationΒ Top Notes:

Redundant Trees in Bipartite Graphs

Highly connected triples and Mader’s conjecture

Gallai’s conjecture for 3-degenerated graphs

Connectivity keeping trees in 3-connected or 3-edge-connected graphs

Mader’s conjecture for graphs with small connectivity

The chromatic number of {ISK4, diamond, bowtie}‐free graphs

A characterization of nonfeasible sets in matching covered graphs