We are pleased to announce the successful graduation of two exceptional Ph.D. candidates from the Algorithm and Logic Group at UESTC. Under the respective guidance of Prof. Bakh Khoussainov and Prof. Mingyu Xiao, they have completed their doctoral programs.

Dr. Zihui Liang
Dissertation Title: A Theoretical Study of Games on Finite Graphs

Zihui Liang earned his bachelor’s degree in Computer Science and Technology from UESTC.
His research focuses on Theoretical Computer Science.
He has made significant contributions to the field of finite graph games, combinatorial game theory, and $\omega$-regular games.
Zihui Liang’s work has been published in renowned conferences and journals, including Inf. Comput., Theoret. Comput. Sci., ESA, MFCS, and COCOON.

---

Dr. Junqiang Peng
Dissertation Title: Parameterized and Exact Algorithms for SAT and Related Problems

Junqiang Peng earned his bachelor’s degree in Computer Science and Technology from UESTC.
His research mainly focuses on Fine-Grained Complexity of NP-hard Problems, Moderately Exponential-Time Algorithms, and Parameterized Complexity, with particular interest in SAT problems and graph problems.
Junqiang’s work has been published in renowned conferences and journals, including Inf. Comput., Theoret. Comput. Sci., IEEE Trans. Netw., SAT, WWW, INFOCOM, AAAI, IJCAI.