Full Citation:
Stefan Szeider. Finding paths in graphs avoiding forbidden transitions. Discr. Appl. Math., volume 126, number 2-3, pages 239-251, 2003.
Stefan Szeider is a Professor at the Algorithms and Complexity Group.