MaxPre: An Extended MaxSAT Preprocessor. - Tuukka Korhonen; Jeremias Berg; Paul Saikko; Matti Järvisalo (SAT, 2017)

Enumerating Potential Maximal Cliques via SAT and ASP. - Tuukka Korhonen; Jeremias Berg; Matti Järvisalo (IJCAI, 2019)

Potential Maximal Cliques Parameterized by Edge Clique Cover. - Tuukka Korhonen (CoRR, 2019)

Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. - Tuukka Korhonen; Jeremias Berg; Matti Järvisalo (ACM J. Exp. Algorithmics, 2019)

Finding Most Compatible Phylogenetic Trees over Multi-State Characters. - Tuukka Korhonen; Matti Järvisalo (AAAI, 2020)

PACE Solver Description: SMS. - Tuukka Korhonen (IPEC, 2020)

SMS in PACE 2020. - Tuukka Korhonen (CoRR, 2020)

Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover. - Tuukka Korhonen (CoRR, 2020)

Listing Small Minimal Separators of a Graph. - Tuukka Korhonen (CoRR, 2020)

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). - Tuukka Korhonen; Matti Järvisalo (CP, 2021)

A Single-Exponential Time 2-Approximation Algorithm for Treewidth. - Tuukka Korhonen (FOCS, 2021)

Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. - Tuukka Korhonen (ICALP, 2021)

Finding Optimal Triangulations Parameterized by Edge Clique Cover. - Tuukka Korhonen (Algorithmica, 2022)

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. - Parinya Chalermsook; Fedor V. Fomin; Thekla Hamm; Tuukka Korhonen; Jesper Nederlof; Ly Orgo (ESA, 2023)

Dynamic treewidth. - Tuukka Korhonen; Konrad Majewski; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (FOCS, 2023)

Tight Lower Bounds for Problems Parameterized by Rank-Width. - Benjamin Bergougnoux; Tuukka Korhonen; Jesper Nederlof (STACS, 2023)

An Improved Parameterized Algorithm for Treewidth. - Tuukka Korhonen; Daniel Lokshtanov (STOC, 2023)

New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. - Benjamin Bergougnoux; Tuukka Korhonen; Igor Razgon (WG, 2023)

SharpSAT-TD in Model Counting Competitions 2021-2023. - Tuukka Korhonen; Matti Järvisalo (CoRR, 2023)

On Induced Versions of Menger's Theorem on Sparse Graphs. - Peter Gartland; Tuukka Korhonen; Daniel Lokshtanov (CoRR, 2023)

Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. - Édouard Bonnet; Jedrzej Hodor; Tuukka Korhonen; Tomás Masarík (CoRR, 2023)

Grid induced minor theorem for graphs of small degree. - Tuukka Korhonen (J. Comb. Theory B, 2023)

Structural perspective on constraint-based learning of Markov networks. - Tuukka Korhonen; Fedor V. Fomin; Pekka Parviainen (AISTATS, 2024)

Minor Containment and Disjoint Paths in Almost-Linear Time. - Tuukka Korhonen; Michal Pilipczuk; Giannos Stamoulis (FOCS, 2024)

Two-Sets Cut-Uncut on Planar Graphs. - Matthias Bentert; Pål Grønås Drange; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen (ICALP, 2024)

Computing Tree Decompositions with Small Independence Number. - Clément Dallard; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Martin Milanic (ICALP, 2024)

Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. - Tuukka Korhonen; Daniel Lokshtanov (SODA, 2024)

Fully dynamic approximation schemes on planar and apex-minor-free graphs. - Tuukka Korhonen; Wojciech Nadara; Michal Pilipczuk; Marek Sokolowski 001 (SODA, 2024)

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth. - Tuukka Korhonen; Marek Sokolowski 001 (STOC, 2024)

Stability in Graphs with Matroid Constraints. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Saket Saurabh 001 (SWAT, 2024)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors. - Maria Chudnovsky; Meike Hatzel; Tuukka Korhonen; Nicolas Trotignon; Sebastian Wiederrecht (CoRR, 2024)

Fast FPT-Approximation of Branchwidth. - Fedor V. Fomin; Tuukka Korhonen (SIAM J. Comput., 2024)

Shortest Cycles with Monotone Submodular Costs. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Daniel Lokshtanov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

Fixed-Parameter Tractability of Maximum Colored Path and Beyond. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Kirill Simonov; Giannos Stamoulis (ACM Trans. Algorithms, 2024)

Packing Short Cycles. - Matthias Bentert; Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; William Lochet; Fahad Panolan; M. S. Ramanujan 001; Saket Saurabh 001; Kirill Simonov (SODA, 2025)

Fixed-Parameter Tractability of Hedge Cut. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Daniel Lokshtanov; Saket Saurabh 001 (SODA, 2025)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More. - Tuukka Korhonen (STOC, 2025)

Computing Paths of Large Rank in Planar Frameworks Deterministically. - Fedor V. Fomin; Petr A. Golovach; Tuukka Korhonen; Giannos Stamoulis (SIAM J. Discret. Math., 2025)

Dynamic Treewidth in Logarithmic Time. - Tuukka Korhonen (CoRR, 2025)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth. - Hans L. Bodlaender; Fedor V. Fomin; Tuukka Korhonen (CoRR, 2025)