28 citations · 44 across the 32 of their papers we have counts for
4 papers · 1 filter
Courcelle's Theorem in Truly Linear FPT
Tuukka Korhonen, Daniel Lokshtanov, Saket Saurabh
Recently, Bumpus, Downey, Eagling-Vose, Enright, Fellows, Kutner, Larios-Jones, Martin, Rosamond, and Yates defined Truly Linear FPT (TLFPT) to be the class of parameterized proble…
Connectivity augmentation is fixed-parameter tractable
Tuukka Korhonen, Mikkel Thorup
In the vertex connectivity augmentation problem, we are given an undirected -vertex graph , a set of links , and integers and…
Branch-width of represented matroids in matrix multiplication time
Mujin Choi, Tuukka Korhonen, Sang-il Oum
For an -element matroid given by an matrix representation over a finite field and an integer , we present an algorithm with running time $O_{k,\m…
Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
A connectivity function on a finite set is a symmetric submodular function with . We prove that finding a branch-decomposition of…