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 combinatorial questions that arise in studying these computational questions.

Our group has received generous supports from European Research Council (ERC), Academy of Finland, and Aalto University.

CURRENT TEAM (Interested in joining us, please read here. )

The Elders

Parinya Chalermsook - Assistant Professor

Joachim Spoerhase - Research fellow

Not too old

Gorav Jindal - Postdoc

Sumedha Uniyal - Postdoc

The Epsilons

Ameet Gadekar

Wanchote Jiamjitrak

Nidia Obscura Acosta

Ly Orgo

Andreas Schmid (joint with Kurt Mehlhorn)

Sorrachai Yingchareonthawornchai (joint with Danupon Nanongkai)

REMOTE RESEACHERS

I am co-supervising the following students

• Daniel Vaz - PhD student at Max Planck Institute for Informatics (Germany)

ACTIVITIES

• 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.