COMBINATORICS OF EFFICIENT COMPUTATIONS
Our group studies various aspects of efficient computations, including for instance approximation algorithms, online algorithms, exact algorithms, combinatorial optimization, and data structures. We focus on studying intrinsic properties of combinatorial objects arising in computations.
Our group has received generous supports from European Research Council (ERC), Academy of Finland, and Aalto University.
Faculty members and research fellows
Parinya Chalermsook - Assistant Professor
Joachim Spoerhase - Research fellow
Sumedha Uniyal - Postdoc
Gorav Jindal - Postdoc (to join in September 2018)
Ameet Gadekar - PhD student
Wanchote Jiamjitrak - PhD student
Nidia Obscura Acosta - PhD student
Ly Orgo - Master student
Interested in joining us, please read here.
I am co-supervising the following students
- Andreas Schmid - PhD student at Max Planck Institute for Informatics (Germany)
- Daniel Vaz - PhD student at Max Planck Institute for Informatics (Germany)
- ALGO 2018 - Helsinki (Finland). August 2018.
For past activities, click here.
If you are interested in visiting our research group -- short-term (at most 2 weeks) or long-term -- please drop an e-mail to Parinya.
The list of past visitors is maintained here.