| 2026 | SODA | Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. | Hans L. Bodlaender, Fedor V. Fomin, Tuukka Korhonen |
| 2026 | STOC | Dynamic Meta-Kernelization. | Christian Bertram, Deborah Haun, Mads Vestergaard Jensen, Tuukka Korhonen |
| 2026 | STOC | Separator Theorem for Minor-Free Graphs in Linear Time. | douard Bonnet, Tuukka Korhonen, Hung Le, Jason Li, Toms Masark |
| 2025 | FOCS | Dynamic Treewidth in Logarithmic Time. | Tuukka Korhonen |
| 2025 | SODA | Packing Short Cycles. | Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov |
| 2025 | SODA | Fixed-Parameter Tractability of Hedge Cut. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh |
| 2025 | STOC | Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More. | Tuukka Korhonen |
| 2024 | AISTATS | Structural perspective on constraint-based learning of Markov networks. | Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen |
| 2024 | FOCS | Minor Containment and Disjoint Paths in Almost-Linear Time. | Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis |
| 2024 | ICALP | Two-Sets Cut-Uncut on Planar Graphs. | Matthias Bentert, Pl Grns Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen |
| 2024 | ICALP | Computing Tree Decompositions with Small Independence Number. | Clment Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic |
| 2024 | SODA | Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. | Tuukka Korhonen, Daniel Lokshtanov |
| 2024 | SODA | Fully dynamic approximation schemes on planar and apex-minor-free graphs. | Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2024 | STOC | Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth. | Tuukka Korhonen, Marek Sokolowski |
| 2023 | ESA | Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. | Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo |
| 2023 | FOCS | Dynamic treewidth. | Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski |
| 2023 | ISAAC | Computing Paths of Large Rank in Planar Frameworks Deterministically. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis |
| 2023 | SODA | Shortest Cycles With Monotone Submodular Costs. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis |
| 2023 | SODA | Fixed-Parameter Tractability of Maximum Colored Path and Beyond. | Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis |
| 2023 | STOC | An Improved Parameterized Algorithm for Treewidth. | Tuukka Korhonen, Daniel Lokshtanov |
| 2023 | STACS | Tight Lower Bounds for Problems Parameterized by Rank-Width. | Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof |
| 2023 | WG | New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. | Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon |
| 2022 | STOC | Fast FPT-approximation of branchwidth. | Fedor V. Fomin, Tuukka Korhonen |
| 2021 | CP | Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). | Tuukka Korhonen, Matti Jrvisalo |
| 2021 | FOCS | A Single-Exponential Time 2-Approximation Algorithm for Treewidth. | Tuukka Korhonen |
| 2021 | ICALP | Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. | Tuukka Korhonen |
| 2020 | AAAI | Finding Most Compatible Phylogenetic Trees over Multi-State Characters. | Tuukka Korhonen, Matti Jrvisalo |
| 2019 | IJCAI | Enumerating Potential Maximal Cliques via SAT and ASP. | Tuukka Korhonen, Jeremias Berg, Matti Jrvisalo |
| 2017 | SAT | MaxPre: An Extended MaxSAT Preprocessor. | Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Jrvisalo |