Tuukka Korhonen

76 papers A* 20A 5B 4Journal 46Unranked 1

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