The complexity of path coloring and call scheduling (2001)

by T Erlebach, K Jansen, C Elvezia
Venue:Theoretical Computer Science