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.