Parinya Chalermsook

Parinya Chalermsook is a Professor of Algorithms at the University of Sheffield, affiliated with the Foundations of Computation Group in the Department of Computer Science, Faculty of Engineering. He also holds a visiting associate professor position at Aalto University, Finland.

His research focuses on theoretical computer science, particularly the interplay between algorithms and mathematical optimization, with strong interests in extremal combinatorics and their applications in TCS. His work spans parameterized complexity, approximation algorithms, computational complexity, and discrete optimization.

The recent articles and talks highlight a strong trend in fine-grained and parameterized computational geometry, graph algorithms, and the synergy between continuous and discrete optimization. His research is deeply theoretical, often bridging mathematical disciplines with algorithmic challenges.

• Simons-Berkeley Research Fellowship (2017)
• ERC Starting Grant (~1.4M Euro, 2017–2024)
• Academy of Finland Research Fellowship (~900K EUR, 2017–2022)

He has supervised numerous PhD students and hosted postdoctoral fellows, fostering a vibrant research group. His research has been supported by major grants from the European Research Council and the Academy of Finland. He actively contributes to the academic community through program committees (e.g., STOC, SODA, ICALP) and organizing workshops at Dagstuhl and Hausdorff Institute.

He is a key member of the Foundations of Computation Group at Sheffield and has previously contributed to the TCS communities at Aalto University and Max Planck Institute for Informatics.