In December 2004, Ulrich Meyer from the Max-Planck-Institut für Informatik visited me at Dalhousie University. He gave a talk on shortest-paths problems, which was also the topic of our research work during his visit. If you liked the talk and want to see the slides or if you couldn't attend the talk, you may be interested in his slides or his webpage.

The second part of the talk is quite compact. Here are the slides from a talk I gave on the same topic in July 2004 in Dagstuhl.