Parinya Chalermsook

Parinya Chalermsook is a Professor of Algorithms at the University of Sheffield and holds a visiting position at Aalto University. He specializes in theoretical computer science with a focus on algorithms, optimization, and combinatorics. His research spans approximation algorithms, online algorithms, data structures, and computational geometry. He has received prestigious awards including the ERC Starting Grant and Simons-Berkeley Research Fellowship. Chalermsook has led projects funded by the European Research Council and Academy of Finland, exploring topics like graph packing and binary search trees. He has advised numerous students, including Sorrachai Yingchareonthawornchai and Ameet Gadekar. His work contributes to UN Sustainable Development Goals through efficient computational methods.

Education: PhD in Computer Science from the University of Chicago (2012), advised by Julia Chuzhoy and Janos Simon. Earlier studies included work under Jittat Fakcharoenphol.

Research Interests: Interplay between algorithms and optimization, with applications in data structures, algorithmic game theory, and computational geometry. Key themes include approximation algorithms, parameterized complexity, and combinatorial optimization.

Recent Projects:

• Combinatorics of Graph Packing and Online Binary Search Trees (Academy of Finland, 2017–2022)
• Parameterized Approximation Algorithms & Hardness (Dagstuhl Seminar, 2023)

Awards:

• ERC Starting Grant (2017)
• Simons-Berkeley Research Fellowship (2017)
• Academy Research Fellow (2017)

Teaching: Courses include Automata, Computation, and Complexity (University of Sheffield), Principles of Algorithmic Techniques (Aalto University), and Computational Complexity.

Professional Activities: PC member for SODA, STOC, ICALP, and conference organization roles including ALGO 2018 and Dagstuhl workshops.