Before revision:  We present two new deterministic algorithms  : the first running in time O(2^{0.441(d-1)n}) and polynomial space, and the second in exponential space with running time of O^*(\tau(d)^{n/2}) for a function \tau(d)\le d.
After revision:  We present two new deterministic algorithms for ATSP : the first running in time O(2^{0.441(d-1)n}) and polynomial space, and the second in exponential space with running time of O^*(\tau(d)^{n/2}) for a function \tau(d)\le d.