I am an assistant professor in the computer science department, Aalto University. My broad area of research interests is in theoretical computer science. More specifically, I study various aspects of efficient computations: approximation algorithms, hardness of approximation, data structures, and online algorithms. I completed my PhD from the department of computer science, University of Chicago in 2012, under the supervision of Julia Chuzhoy (at TTI-C) and Janos Simon. 

After my Ph.D, I did a short (and yet very pleasant) postdoc at IDSIA. Afterwards, I spent 3.5 years rising from a postdoc to a senior researcher at Max Planck Institute for Informatics

I am leading the newly founded research group "Combinatorics of Efficient Computations". I will be looking for highly motivated PhD students. Please do not hesitate to contact me if you are interested! 

In Thailand, I obtained a bachelor of engineering from Kasetsart University and master's of science from Asian Institute of Technology, where I worked on several projects, including signal processing, algorithms, and formal methods. 

I had quite an enjoyable moment as a lecturer at Kasetsart University (Thailand) from May 2002 to August 2005.


News

  • Fully funded PhD positions at Aalto We are recruiting highly motivated PhD students! http://www.hict.fi/spring2017Deadline: 5 March, 2017. There are many opportunities in Algorithms and Complexity. I am looking for a student ...
    Posted Mar 1, 2017, 12:45 PM by Parinya Chalermsook
  • ISAAC 2017 PC I will be on PC of International Symposium on Algorithms and Computation (ISAAC 2017), to be held in in Phuket, Thailand. Submit your interesting paper(s) and come enjoy the ...
    Posted Oct 17, 2016, 9:22 AM by Parinya Chalermsook
  • SODA 2017 Our paper "Beyond Metric-tree Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs" has been accepted to SODA 2017. We will enjoy the first SODA in Europe! 
    Posted Oct 5, 2016, 8:23 AM by Parinya Chalermsook
  • ALGO 2018 in Helsinki Petteri KaskiJukka Suomela and I will be organizing ALGO 2018 in Helsinki. Please join us in this event. It will be a lot of fun!  
    Posted Sep 3, 2016, 1:07 AM by Parinya Chalermsook
Showing posts 1 - 4 of 4. View more »




Representative papers
Here is a list of what I view as my "most interesting" publications. For the full list of publications, please refer to the publication page.
  1. Pattern Avoiding Access in Binary Search Trees. [PDF]
    P. Chalermsook, M. Goswami, L. Kozma, K. Mehlhorn, and T. Saranurak. 
    FOCS 2015 &  
    HALG 2016 (contributed paper)


  2. Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. [PDF]
    P. Chalermsook, B. Laekhanukit, D. Nanongkai 
    FOCS 2014

  3. Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. [PDF]
    P. Chalermsook, B. Laekhanukit, D. Nanongkai. 
    FOCS 2013

  4. Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension, and More. [PDF]
    P. Chalermsook, B. Laekhanukit, D. Nanongkai. 
    SODA 2013

  5. Approximation Algorithms and Hardness of Integral Concurrent Flow. [PDF]
    P. Chalermsook, J. Chuzhoy, A. Ene, S. Li. 
    STOC 2012.

  6. Maximum Independent Set of Rectangles. [PDF]
    P. Chalermsook, J. Chuzhoy. 
    SODA 2009.



Professional Services
  • PC Member
    • International Symposium on Algorithms and Computation (ISAAC 2017
    • European Symposium on Algorithms (ESA 2016
    • Fun with Algorithms (FUN 2016)
    • Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
    • International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2015

  • Organizer
    • European Symposium on Algorithms (ESA) 2018. With Petteri Kaski and Jukka Suomela. 
    • Max Planck Advanced Course on Foundations of Computer Science (ADFOCS) 2014. With A. Karrenbauer.