Tuukka Korhonen

According to our database, Tuukka Korhonen authored at least 38 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Fixed-Parameter Tractability of Hedge Cut.

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Packing Short Cycles.

Matthias Bentert, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, William Lochet, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Kirill Simonov

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

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, October, 2024

Shortest Cycles with Monotone Submodular Costs.

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis

ACM Trans. Algorithms, January, 2024

Fast FPT-Approximation of Branchwidth.

Fedor V. Fomin, Tuukka Korhonen

SIAM J. Comput., 2024

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More.

Tuukka Korhonen

CoRR, 2024

Unavoidable induced subgraphs in graphs with complete bipartite induced minors.

Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht

CoRR, 2024

Stability in Graphs with Matroid Constraints.

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth.

Tuukka Korhonen, Marek Sokolowski

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Fully dynamic approximation schemes on planar and apex-minor-free graphs.

Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition.

Tuukka Korhonen, Daniel Lokshtanov

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Computing Tree Decompositions with Small Independence Number.

Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Two-Sets Cut-Uncut on Planar Graphs.

Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Minor Containment and Disjoint Paths in Almost-Linear Time.

Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Structural perspective on constraint-based learning of Markov networks.

Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

Grid induced minor theorem for graphs of small degree.

Tuukka Korhonen

J. Comb. Theory B, May, 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

On Induced Versions of Menger's Theorem on Sparse Graphs.

Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov

CoRR, 2023

SharpSAT-TD in Model Counting Competitions 2021-2023.

Tuukka Korhonen, Matti Järvisalo

CoRR, 2023

New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth.

Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

An Improved Parameterized Algorithm for Treewidth.

Tuukka Korhonen, Daniel Lokshtanov

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Tight Lower Bounds for Problems Parameterized by Rank-Width.

Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Computing Paths of Large Rank in Planar Frameworks Deterministically.

Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Dynamic treewidth.

Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Polynomial-Time Approximation of Independent Set Parameterized by Treewidth.

Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Finding Optimal Triangulations Parameterized by Edge Clique Cover.

Tuukka Korhonen

Algorithmica, 2022

2021

Lower Bounds on Dynamic Programming for Maximum Weight Independent Set.

Tuukka Korhonen

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

A Single-Exponential Time 2-Approximation Algorithm for Treewidth.

Tuukka Korhonen

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper).

Tuukka Korhonen, Matti Järvisalo

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020

Listing Small Minimal Separators of a Graph.

Tuukka Korhonen

CoRR, 2020

Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover.

Tuukka Korhonen

CoRR, 2020

SMS in PACE 2020.

Tuukka Korhonen

CoRR, 2020

PACE Solver Description: SMS.

Tuukka Korhonen

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

Finding Most Compatible Phylogenetic Trees over Multi-State Characters.

Tuukka Korhonen, Matti Järvisalo

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

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

Potential Maximal Cliques Parameterized by Edge Clique Cover.

Tuukka Korhonen

CoRR, 2019

Enumerating Potential Maximal Cliques via SAT and ASP.

Tuukka Korhonen, Jeremias Berg, Matti Järvisalo

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2017

MaxPre: An Extended MaxSAT Preprocessor.

Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017