2 citations · 6 across the 10 of their papers we have counts for
10 papers
Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
Tuukka Korhonen
We present time algorithms for various problems about decomposing a given undirected graph by edge cuts or vertex separators of size into parts that are ``well-…
Minor Containment and Disjoint Paths in almost-linear time
Tuukka Korhonen, Michał Pilipczuk, Giannos Stamoulis
We give an algorithm that, given graphs and , tests whether is a minor of in time ; here, is the number of vertices of and the ${\cal…
Structural perspective on constraint-based learning of Markov networks
Tuukka Korhonen, Fedor V. Fomin, Pekka Parviainen
Markov networks are probabilistic graphical models that employ undirected graphs to depict conditional independence relationships among variables. Our focus lies in constraint-base…
Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
Tuukka Korhonen, Marek Sokołowski
We give an algorithm that given a graph with vertices and edges and an integer , in time either outputs a rank decomposition of of width…
Fully dynamic approximation schemes on planar and apex-minor-free graphs
Tuukka Korhonen, Wojciech Nadara, Michał Pilipczuk +1
The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and…
On Induced Versions of Menger's Theorem on Sparse Graphs
Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov
Let and be sets of vertices in a graph . Menger's theorem states that for every positive integer , either there exists a collection of vertex-disjoint paths betwe…