Research Team

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, from (mostly) structural perspectives. The approaches typically view computational problems as simple structural problems about certain discrete structures and approach the problems through the study of intrinsic properties of such structures. 

Current active projects of our group include: 
  • Graph packing problems in general 

  • Packing and covering with "group constraints"

  • Online binary search trees  

Current Team members 
  1. Wanchote Jiamjitrak 
    PhD student, Aalto University

  2. Andreas Schmid 
    PhD student, Max Planck Institute for Informatics, Germany 

  3. Daniel Vaz 
    PhD student, Max Planck Institute for Informatics, Germany 

  4. Sumedha Uniyal 
    Visiting student from IDSIA, Switzerland  

Affiliated members and regular visitors 


  • [January 26-28, 2017] 
    Mayank Goswami is visiting our group. 
  • [January, 16-20, 2017]
    Parinya and Daniel attended ACM-SIAM Symposium on Discrete Algorithms (SODA), in Barcelona, Spain. Daniel presented our paper. 
  • [January 9-14, 2017]
    Parinya gave a tutorial talk at the "International Collaboration Workshop in Algorithms" at Universidad de Chile, Santiago.
  • [December 4-16, 2016]
    Parinya visited Toyota Technological Institute and gave a talk there.  
  • [November 14-18, 2016]
    Parinya is visiting KTH, Sweden. 
  • [October 23-29, 2016]
    Thatchaphol Saranurak is visiting us again! 
  • [September 12-24, 2016]
    Andreas Schmid and Daniel Vaz (both from MPI) are visiting.  
  • [September 22-25, 2016]
    Danupon Nanongkai and Thatchaphol Saranurak are visiting our group. 

Algorithms and Complexity at Aalto 
There are potentials to collaborate with other research groups at Aalto University in the themes of algorithms and complexity (e.g. distributed algorithms, natural computation, and combinatorial algorithms). Our students are encouraged to expand their research horizons by discussing with other research groups.