Professor Parinya Chalermsook
School of Computer Science
Professor of Algorithms
+44 114 222 1852
Full contact details
School of Computer Science
Regent Court (DCS)
211 Portobello
Sheffield
S1 4DP
- Profile
-
Parinya earned his PhD at the University of Chicago in 2012. From 2013 to 2016, he worked at the Max Planck Institute for Informatics, followed by eight years at Aalto University in Finland, where he served as an assistant professor and later as an associate professor. In 2025, he joined the University of Sheffield as a Professor of Algorithms.
Parinya's research explores the intersection of algorithms, combinatorics, and optimization. He has received several early-career awards for his research, including an ERC Starting Grant (2018), a Simons-Berkeley Research Fellowship (2017), and an Academy of Finland Research Fellowship (2017). To date, he has supervised six PhD graduates and hosted five postdoctoral researchers.
- Research interests
-
Theoretical computer science
- Publications
-
Journal articles
- Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms, 20(1), 1-20.
Conference proceedings papers
- Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 297
- Parameterized approximation schemes for clustering with general norm objectives. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) Proceedings (pp 1377-1399). Santa Cruz, CA, USA, 6 November 2023 - 6 November 2023. View this article in WRRO
- Research group