Is it always possible to convert a k-tape Turing machine to a single-tape one without increasing its running time complexity exponentially?
It actually depends on the way you implement a k-tape Turing Machine as a single-tape one. 

Using the standard implementation, you can prove that the single-tape machine will take quadratically more computation time.