Professor Parinya Chalermsook

School of Computer Science

Professor of Algorithms

p.chalermsook@sheffield.ac.uk
+44 114 222 1852

Regent Court (DCS)

Full contact details

Professor Parinya Chalermsook
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

Chalermsook P, Kaul M, Mnich M, Spoerhase J, Uniyal S & Vaz D (2024) Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Transactions on Algorithms, 20(1), 1-20.

Chapters

Chalermsook P, Gadekar A, Khodamoradi K & Spoerhase J (2023) Independent Set in k-Claw-Free Graphs: Conditional $$chi $$-Boundedness and the Power of LP/SDP Relaxations, Lecture Notes in Computer Science (pp. 205-218). Springer Nature Switzerland

Conference proceedings papers

Abbasi F, Byrka J, Gadekar A, Marx D, Spoerhase J, Banerjee S, Chalermsook P, Khodamoradi K & Sharma R (2024) Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. Leibniz International Proceedings in Informatics, LIPIcs, Vol. 297
Chalermsook P, Gupta M, Jiamjitrak W, Pareek A & Yingchareonthawornchai S (2024) The Group Access Bounds for Binary Search Trees. Leibniz International Proceedings in Informatics
Chalermsook P, Pettie S & Yingchareonthawornchai S (2024) Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns (pp 133-149)
Abbasi F, Banerjee S, Byrka J, Chalermsook P, Gadekar A, Khodamoradi K, Marx D, Sharma R & Spoerhase J (2023) 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
Antoniadis A, Capretto M, Chalermsook P, Damerius C, Kling P, Nölke L, Obscura Acosta N & Spoerhase J (2021) On Minimum Generalized Manhattan Connections (pp 85-100)

Research group: Foundations of computation (FOX)