Tuukka Korhonen

Available identifiers

zbMath Open korhonen.tuukkaMaRDI QIDQ2161005

List of research outcomes

Publication	Date of Publication	Type
Computing paths of large rank in planar frameworks deterministically	2025-01-22	Paper
Polynomial-time approximation of independent set parameterized by treewidth	2025-01-06	Paper
Fully dynamic approximation schemes on planar and apex-minor-free graphs	2024-11-28	Paper
Induced-minor-free graphs: separator theorem, subexponential algorithms, and improved hardness of recognition	2024-11-28	Paper
Tight lower bounds for problems parameterized by rank-width	2024-10-08	Paper
Fast FPT-approximation of branchwidth	2024-08-27	Paper
Shortest cycles with monotone submodular costs	2024-05-14	Paper
Fixed-parameter tractability of maximum colored path and beyond	2024-05-14	Paper
An improved parameterized algorithm for treewidth	2024-05-08	Paper
New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth	2024-05-03	Paper
Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor	2023-12-13	Paper
Fast FPT-approximation of branchwidth	2023-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q6089669	2023-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q6089678	2023-11-13	Paper
On Induced Versions of Menger's Theorem on Sparse Graphs	2023-09-15	Paper
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition	2023-08-09	Paper
Grid induced minor theorem for graphs of small degree	2023-03-23	Paper
Finding optimal triangulations parameterized by edge clique cover	2022-08-03	Paper
Computing Tree Decompositions with Small Independence Number	2022-07-20	Paper
Grid Induced Minor Theorem for Graphs of Small Degree	2022-03-24	Paper
Tight Bounds for Potential Maximal Cliques Parameterized by Vertex Cover	2020-11-23	Paper
Solving Graph Problems via Potential Maximal Cliques	2019-03-27	Paper
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth	N/A	Paper
Minor Containment and Disjoint Paths in almost-linear time	N/A	Paper
Unavoidable induced subgraphs in graphs with complete bipartite induced minors	N/A	Paper

Research outcomes over time

This page was built for person: Tuukka Korhonen