Vertex Cover problem modification
For fixed $c$ (i.e., we consider $c$ as a constant) this is trivially solvable in time $n^cm$ which is polynomial in $n$, however, if $k$ is part of the input, then $n^k$ would be considered exponential in $k$.

Vertex cover is solvable in $2^k \cdot n^{O(1)}$.