Parinya Chalermsook

This fully funded PhD studentship at the University of Sheffield explores the deep connections between algorithms and combinatorics, focusing on both classical computational problems with inherent combinatorial aspects and extremal problems motivated by algorithmic perspectives. The project aims to leverage techniques from one area to inspire progress in another, addressing long-standing open problems in theoretical computer science and mathematics. Research themes include the analysis of dynamic data structures through forbidden submatrices, advances in Ramsey theory and graph packing, and the development of algorithmic extremal combinatorics. Recent successes in clustering and efficient algorithms highlight the innovative nature of this research. The project is supervised by Professor Parinya Chalermsook, an expert in the interplay between computation and combinatorics, and Dr. Mikhail Zhukovskii. The School of Computer Science at Sheffield is recognized for its world-leading research environment, ranked 8th nationally in the UK. The studentship covers UK or overseas tuition fees and provides a tax-free stipend at the standard UK Research Council rate (£20,780 for 2025/26) for 3.5 years. Applicants should have a strong mathematical or algorithmic background, a passion for research, and resilience in tackling challenging problems. Minimum requirements include a 2.1 undergraduate honours degree or a Master’s degree with Merit in a relevant discipline (such as Computer Science or Mathematics), or an international equivalent. Non-native English speakers must have an IELTS score of 6.5 overall (with no less than 6.0 in each component). To apply, submit your application via the University of Sheffield’s Postgraduate Online Application Form, naming Prof. Parinya Chalermsook as your proposed supervisor. Include a research proposal (up to 4 A4 pages with references) outlining your motivation, approach, and relevant skills. The deadline for applications is April 30, 2026.