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.
Research
Publications
- Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. Tuukka Korhonen. ICALP 2021. Arxiv version.
- Finding Optimal Triangulations Parameterized by Edge Clique Cover. Tuukka Korhonen. IPEC 2020 (Best Paper Award). Arxiv version.
- PACE solver description: SMS. Tuukka Korhonen. IPEC 2020. Arxiv version.
- Finding Most Compatible Phylogenetic Trees over Multi-State Characters. Tuukka Korhonen and Matti Järvisalo. AAAI 2020.
- Enumerating Potential Maximal Cliques via SAT and ASP. Tuukka Korhonen, Jeremias Berg and Matti Järvisalo. IJCAI 2019.
- Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. Tuukka Korhonen, Jeremias Berg and Matti Järvisalo. ACM Journal of Experimental Algorithmics, Volume 24 Issue 1, 2019.
- MaxPre: An Extended MaxSAT Preprocessor. Tuukka Korhonen, Jeremias Berg, Paul Saikko and Matti Järvisalo. SAT 2017.
Preprints
- A Single-Exponential Time 2-Approximation Algorithm for Treewidth. Tuukka Korhonen. 2021.
- Listing Small Minimal Separators of a Graph. Tuukka Korhonen. 2020.
- Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover. Tuukka Korhonen. 2020.
Thesis
- Finding Optimal Tree Decompositions. MSc thesis, University of Helsinki, 2020.
Software
- SharpSAT-TD - #SAT-solver that utilizes 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.
Talks
- Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. (slides, video) at ICALP 2021.
- SharpSAT-TD: Improving SharpSAT by Exploiting Tree Decompositions. (slides, video) at Workshop on Model Counting 2021.
- A Single-Exponential Time 2-Approximation Algorithm for Treewidth. (slides, video) at Frontiers of Parameterized Complexity online seminar, May 2021.
- 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.
Awards
- IPEC 2020 Best Paper Award and Best Student Paper Award
Competitions
- 1st place in Model Counting Competition 2021, tracks 1, 2, and 4.
- 2nd place in PACE 2020, exact treedepth track.
- 2nd place in PACE 2017, exact minimum fill-in track.
Reviewing
- Conference PC member: AAAI 2021
- Conference external reviewer: SAT 2021, ICALP 2021, MFCS 2020, SAT 2020
- Journal reviewer: Theoretical Computer Science
Other
Education
- 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 19 July 2021