I am a PhD student in the ACiD (Algorithms and Complexity in Durham) group supervised by Dr Barnaby Martin and Professor Andrei Krokhin.
My main research area is the complexity of the Quantified Constraint Satisfaction Problem (QCSP) on graphs, focusing particularly on different kinds of QCSP problems restricted to different kinds of graphs.
PhD, Computer Science, Durham University, October 2024–present
Master, Mathematics, University of Leeds, September 2022 – September 2023
Exploring the structure of non-computability
Quantified Colouring and H-Free Algorithmics
Asimi, K., Eagling-Vose, T., Guzmán-Pro, S., Martin, B., & Qiu, Y. (2026). Quantified Colouring and H-Free Algorithmics. In J. Kozik & A. Wolff (Eds.), SOFSEM 2026: Theory and Practice of Computer Science: 51st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2026, Kraków, Poland, February 9–13, 2026, Proceedings (pp. 447–460). Springer, Cham. https://doi.org/10.1007/978-3-032-17801-5_33
Talk: Quantified Colouring and H-Free Algorithmics
Computer Science Demonstrator, Durham University, October 2025–present