Rod Downey
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Discrete Math×1Algorithms×1
Frequent co-authors
Research Timeline
2026
$O(n +f(k))$: Truly Linear FPT
The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms for various parameterized problems.
Highlighted terms show continued research focus across papers