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.

CURRENT TEAM

Faculty members and research fellows

Parinya Chalermsook - Assistant Professor

Joachim Spoerhase - Research fellow (starting in August 2018)

Researchers

Sumedha Uniyal - Postdoc

Gorav Jindal - Postdoc (starting in August 2018)

Students

Ameet Gadekar - PhD student

Wanchote Jiamjitrak - PhD student

Nidia Obscura Acosta - PhD student

Ly Orgo - Master student

Interested in joining us, please read here.

CURRENT LONG-TERM VISITORS

The following two students are visiting in Summer 2018 to work on a collaboration between Aalto and KTH (Prof. Danupon Nanongkai's group).

Pattara Sukprasert - PhD student at University of Maryland

Sorrachai Yingcharoenthawornchai - PhD student at Michigan State University

REMOTE RESEACHERS

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)

ACTIVITIES

• ESA-ALGO 2018 - Helsinki (Finland). August 2018.

For past activities, click here.

VISITORS

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.