Professor Parinya Chalermsook

About

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.

Selected publications

• 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.
• Chalermsook P, Jiamjitrak W, Orgo L & Zarsav M (2027) Bi-Perfect Graphs and the Approximability of Maximum Balanced Biclique, Lecture Notes in Computer Science (pp. 1-14). Springer Nature Singapore
• Chalermsook P & Huang C-C (2025) Approximate Cut & Packing Ratios for Multi-commodity Arborescences, Lecture Notes in Computer Science (pp. 172-183). Springer Nature Switzerland
• 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
• (2026) Hardness and Approximation for Coloring Digraphs. Leibniz International Proceedings in Informatics Lipics, Vol. 374
• Blank L, Bringmann K, Chalermsook P, Karthik C. S. , Kolbe B, Le H & van Wordragen G (2026) Fine-Grained Complexity of Continuous Euclidean k-Center. Proceedings of the 58th Annual ACM Symposium on Theory of Computing (pp 330-341) View this article in WRRO
• Chalermsook P, Jiang Y, Mukhopadhyay S & Nanongkai D (2026) Shortcuts and Transitive-Closure Spanners Approximation (pp 3536-3561)
• Chalermsook P, Kugelmann A, Orgo L, Uniyal S & Zarsav M (2025) An Improved Guillotine Cut for Squares. Leibniz International Proceedings in Informatics Lipics, Vol. 349
• Chalermsook P, Orgo L & Zarsav M (2025) On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers. Leibniz International Proceedings in Informatics Lipics, Vol. 357
• 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