Before revision:  We provide a simple algorithm to solve the k-Disjonit Shortest Paths with Congestion-c problem in time f(k) n^{O(k-c)} on DAGs.
After revision:  We provide a simple algorithm to solve the problem in time f(k) n^{O(k-c)} on DAGs.