Algorithm Engineering: A Sample Lecture

Kurt Mehlhorn (Max-Plank Institute, Saarbruecken)

Algorithm Engineering is a new buzz word. In my talk I attempt to answer
two questions:
  What is algorithm engineering?
  How can we teach it?
The second item will be addressed by giving a sample lecture on algorithms
for maximum matchings in bipartite graphs. I contrast what I would teach
in an algorithms course and what I would teach in an algorithms engineering
course.