Tuukka Korhonen

I am currently doing my mandatory (non)-military service as a research assistant in the Constraint Reasoning and Optimization group in University of Helsinki. My research interests are algorithms for NP-hard problems, in both theory and practice, and in particular topics related to tree decompositions.






  • SMS - Exact algorithm for computing treedepth using small minimal separators.
  • Triangulator - Implementation of the Bouchitté-Todinca algorithm for exact computing of optimal triangulations with various notions of "optimal".
  • MaxPre - MaxSAT preprocessor.


  • IPEC 2020 Best Paper Award and Best Student Paper Award


  • A Single-Exponential Time 2-Approximation Algorithm for Treewidth (slides, video) at Frontiers of Parameterized Complexity seminar.
  • Finding Optimal Triangulations Parameterized by Edge Clique Cover (slides, video) at IPEC 2020.
  • PACE solver description: SMS (slides) at IPEC 2020.
  • Finding Most Compatible Phylogenetic Trees over Multi-State Characters (slides, poster) at AAAI 2020.
  • Enumerating Potential Maximal Cliques via SAT and ASP (slides, poster) at IJCAI 2019.


  • 2nd place in PACE 2020 algorithm implementation competition, exact treedepth track.
  • 2nd place in PACE 2017 algorithm implementation competition, exact minimum fill-in track.




  • Master of Science, Computer Science, University of Helsinki, 7/2020.
  • Bachelor of Science, Computer Science, University of Helsinki, 9/2019.

Work experience

  • 6/2016-6/2017, 10/2017-5/2018, 2/2019-current. Research assistant in Constraint Reasoning and Optimization group in University of Helsinki.
  • 6/2018-12/2018. Software engineering intern at Google Zürich.
  • 7/2017-9/2017. Software developer intern at Jane Street London.

Programming contests

  • My profiles at online programming contest sites: Codeforces, Topcoder, Atcoder.
  • Results in ICPC: 13th in finals 2017, 14th in finals 2016, 2nd in NWERC 2016, 1st in NWERC 2015, 1st in NCPC 2016, 2nd in NCPC 2015.

Misc links

Updated on 4 June 2021