Combinatorics of Efficient Computations
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 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.
Department of Computer Science
- Published:
- Updated: