Tuukka Korhonen

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 58

Top Topics

Independent Set

Tree Decompositions

Approximation Schemes

Top Venues

Publications

Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
Structural perspective on constraint-based learning of Markov networks. AISTATS (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles with Monotone Submodular Costs. ACM Trans. Algorithms 20 (1) (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. SWAT (2024)
Tuukka Korhonen, Marek Sokolowski
Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth. STOC (2024)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Saket Saurabh
Stability in Graphs with Matroid Constraints. CoRR (2024)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-Approximation of Branchwidth. SIAM J. Comput. 53 (4) (2024)
Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
Structural perspective on constraint-based learning of Markov networks. CoRR (2024)
Tuukka Korhonen, Marek Sokolowski
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth. CoRR (2024)
Tuukka Korhonen, Daniel Lokshtanov
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. SODA (2024)
Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR (2024)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. ICALP (2024)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-Sets Cut-Uncut on Planar Graphs. ICALP (2024)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. SODA (2024)
Tuukka Korhonen, Michal Pilipczuk, Giannos Stamoulis
Minor Containment and Disjoint Paths in almost-linear time. CoRR (2024)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR (2023)
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen
Two-sets cut-uncut on planar graphs. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. SODA (2023)
Édouard Bonnet, Jedrzej Hodor, Tuukka Korhonen, Tomás Masarík
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor. CoRR (2023)
Tuukka Korhonen, Daniel Lokshtanov
An Improved Parameterized Algorithm for Treewidth. STOC (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-Width. STACS (2023)
Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA (2023)
Tuukka Korhonen, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Fully dynamic approximation schemes on planar and apex-minor-free graphs. CoRR (2023)
Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov
On Induced Versions of Menger's Theorem on Sparse Graphs. CoRR (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG (2023)
Tuukka Korhonen, Daniel Lokshtanov
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition. CoRR (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. FOCS (2023)
Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski
Dynamic treewidth. CoRR (2023)
Tuukka Korhonen, Matti Järvisalo
SharpSAT-TD in Model Counting Competitions 2021-2023. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing paths of large rank in planar frameworks deterministically. CoRR (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. SODA (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Giannos Stamoulis
Computing Paths of Large Rank in Planar Frameworks Deterministically. ISAAC (2023)
Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon
New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR (2023)
Tuukka Korhonen
Grid induced minor theorem for graphs of small degree. J. Comb. Theory, Ser. B 160 (2023)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Kirill Simonov, Giannos Stamoulis
Fixed-Parameter Tractability of Maximum Colored Path and Beyond. CoRR (2022)
Tuukka Korhonen
Grid Induced Minor Theorem for Graphs of Small Degree. CoRR (2022)
Tuukka Korhonen, Daniel Lokshtanov
An Improved Parameterized Algorithm for Treewidth. CoRR (2022)
Tuukka Korhonen
Finding Optimal Triangulations Parameterized by Edge Clique Cover. Algorithmica 84 (8) (2022)
Benjamin Bergougnoux, Tuukka Korhonen, Jesper Nederlof
Tight Lower Bounds for Problems Parameterized by Rank-width. CoRR (2022)
Tuukka Korhonen
A Single-Exponential Time 2-Approximation Algorithm for Treewidth. FOCS (2022)
Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic
Computing Tree Decompositions with Small Independence Number. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Daniel Lokshtanov, Giannos Stamoulis
Shortest Cycles With Monotone Submodular Costs. CoRR (2022)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-approximation of branchwidth. STOC (2022)
Tuukka Korhonen, Matti Järvisalo
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). CP (2021)
Tuukka Korhonen
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. ICALP (2021)
Fedor V. Fomin, Tuukka Korhonen
Fast FPT-Approximation of Branchwidth. CoRR (2021)
Tuukka Korhonen
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. CoRR (2021)
Tuukka Korhonen
Single-Exponential Time 2-Approximation Algorithm for Treewidth. CoRR (2021)
Tuukka Korhonen
A Single-Exponential Time 2-Approximation Algorithm for Treewidth. FOCS (2021)
Tuukka Korhonen
PACE Solver Description: SMS. IPEC (2020)
Tuukka Korhonen
SMS in PACE 2020. CoRR (2020)
Tuukka Korhonen, Matti Järvisalo
Finding Most Compatible Phylogenetic Trees over Multi-State Characters. AAAI (2020)
Tuukka Korhonen
Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover. CoRR (2020)
Tuukka Korhonen
Finding Optimal Triangulations Parameterized by Edge Clique Cover. IPEC (2020)
Tuukka Korhonen
Listing Small Minimal Separators of a Graph. CoRR (2020)
Tuukka Korhonen
Potential Maximal Cliques Parameterized by Edge Clique Cover. CoRR (2019)
Tuukka Korhonen, Jeremias Berg, Matti Järvisalo
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. ACM J. Exp. Algorithmics 24 (1) (2019)
Tuukka Korhonen, Jeremias Berg, Matti Järvisalo
Enumerating Potential Maximal Cliques via SAT and ASP. IJCAI (2019)
Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo
MaxPre: An Extended MaxSAT Preprocessor. SAT (2017)