What is the fastest algorithm to solve $k$-path problem?
For FPT algorithms (ignoring the polynomial factors), there is a $2.851^k \cdot n^{O(1)}$ deterministic algorithm and a $1.66^k  \cdot n^{O(1)}$ randomized algorithm.

See Table of FPT races for references.