Kurt Mehlhorn -- Teaching

Recent Courses

Some Recent Tutorials, Short Courses and Invited Talks

Phasarum can compute shortest paths, Basics of Electrical Networks , Approximate MaxFlow, Exercises, Erice Summer School, September 2011
The Physarum Computer, WALCOM, Delhi, and Workshop on Frontiers in Computing, KAUST, February 2011, and ICALP Workshop, July 2011
Geometric Computing and Root Isolation, International Conference on Mathematical Software (ICMS), Kobe, 2010
Selfish Routing and Coordination Mechanisms, ODSA, Rostock, 2010
Certifying Algorithms, Frontiers of Algorithms Workshop, Wuhan, 2010
Algorithmen, 1970 -- 2010, 40ter Geburtstag des Fachbereichs Informatik der Universitaet des Saarlandes
How to Assign Papers to Referees, 36th ICALP, July 2009
Geometric Computing, The Science of Making Geometric Algorithms Work, 25th ACM Symposium on Computational Geometry, June 2009
Cycle Bases in Graphs: Structure, Algorithms, Applications, and Open Problems (Erice Talk), Cycle Bases in Graphs: Structure, Algorithms, Applications, and Open Problems (Kanazawa Talk), Erice School on Graph Theory, Algorithms, and Applications, July 2008; Japan Conference on Computational Geometry and Graphs, November 2009
The Science behind LEDA and CGAL, Lipari Summer School in Computer Science , July 2008
Cycle Basis in Graphs , Mathematical Foundations of Computer Science, September 07
Remarks on Matchings , International Conference on Combinatorial Optimization and Application, August 07
Reliable and Efficient Geometric Computing , European Symposium on Algorithms, September 06
Reliable and Efficient Geometric Computing , Italian Theory Conference, March 2006 and German OR Symposium, August 2006
Reliable Geometric Computing via Controlled Perturbation? , Dutch Theory Day, March 06
Cycle Basis in Graphs and Curve and Surface Reconstruction, Graph Drawing Conference, September 2005
Implementing Algorithms, Estonian Winter School in Computer Science , February-March 2005
Three Results on Matchings, BECO 2004,
Certifying Algorithms, BCTCS,
Reliable Algorithmic Software, Semesterkolloquium, Fakultät für Informatik, TH Karlsruhe
The EXACUS Project
Talk overview for EPFL spring school in Zinal, March 2002
Some of the Theory Behind LEDA, plenary talk given at SODA02 in San Francisco, January 2002
Geometric Predicates, a three hour tutorial given at the ECG workshop in Leiden, October 2001
Algorithm Engineering, a one day tutorial given at the ALCOM-FT Summer School in Rome, September 2001
Implementing Geometric Algorithms with LEDA and CGAL (pdf, compressed postscript), a one day tutorial given togehter with Susan Hert at the ACM Solid Modeling Conference in Ann Arbor, June 01