Parinya Chalermsook
Visitor
Visitor
T313 Dept. Computer Science
Research interests: Parinya studies the interplay between algorithms and optimization. He has worked on computational problems arising from a wide range of domains, such as data structures, algorithmic game theory, networking, and computational geometry. He has been awarded a Simons-Berkeley Research Fellowship and an ERC Starting Grant.
More info:
Full researcher profile
https://research.aalto.fi/...
Sähköposti
ext-parinya.chalermsook@aalto.fi
Puhelinnumero
+358504738018
Osaamisalueet
approximation algorithms, combinatorial optimisation, discrete mathematics
Palkinnot
Academy research fellow
Award or honor granted for academic or artistic career
Professorship Chalermsook Parinya
May 2017
Simons-Berkeley Research Fellowship
A fellowship granted annually for top junior researchers (up to 6 years after PhD) in the field of algorithms and complexity. This fellowship funds a residency of the granted fellow for spending 4 months at the Simons Institute for the Theory of Computing (UC Berkeley).
Award or honor granted for academic or artistic career
Professorship Chalermsook Parinya
Aug 2017
ERC Starting Grant
Award or honor granted for academic or artistic career
Professorship Chalermsook Parinya
Aug 2017
Julkaisut
An Improved Guillotine Cut for Squares
Parinya Chalermsook, Axel Kugelmann, Ly Orgo, Sumedha Uniyal, Minoo Zarsav
2025
19th International Symposium on Algorithms and Data Structures, WADS 2025
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces
Fateme Abbasi, Jarosław Byrka, Ameet Gadekar, Dániel Marx, Joachim Spoerhase, Sandip Banerjee, Parinya Chalermsook, Kamyar Khodamoradi, Roohani Sharma
2024
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
2024
ACM Transactions on Algorithms
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns
Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai
2024
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
The Group Access Bounds for Binary Search Trees
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai
2024
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
2023
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai
2023
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Independent Set in k-Claw-Free Graphs : Conditional X-Boundedness and the Power of LP/SDP Relaxations
Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase
2023
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings
Pinning Down the Strong Wilber-1 Bound for Binary Search Trees
Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak
2023
THEORY OF COMPUTING
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth
Parinya Chalermsook, Fedor Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
2023
31st Annual European Symposium on Algorithms, ESA 2023