Teaching
Recent Courses
- Algorithm Engineering (together with Eric Berberich und Pawel Gawrychowski), Summer 2012
- Reading Group in Algorithms (together with Carola Winzen), Summer 2012
- Computational Thinking: Informatik fuer Hoerer aller Fakultaeten (zusammen mit Kostas Panagiotou), Winter 2011/12, Poster SB, Poster Homburg
- Reading Group in Algorithms (together with Carola Winzen), Winter 2011/12
- Algorithmic Game Theory (together with Rob van Stee), Summer 2011
- Reading Group in Algorithms (together with Carola Winzen), Summer 2011
- Models of Computation (together with Konstantinos Panagiotou and Reto Spoehel), Winter 2010/11
- Optimization (together with Nicole Megow and Julian Mestre), Summer 2010
- Computational Geometry and Geometric Computing (together with Michael Sagraloff and Eric Berberich), Winter 2009/10
- Seminar on Modern Topics in Algorithms: Game Theory (together with Chien-Chung Huang), Winter 2009/10
- Selected Topics in Algorithms (Summer 2009)
- Seminar on Evolvability, Natural Algorithms and Learning (Spring 2009)
- Data Structures and Algorithms (Summer 2008)
- Algorithm Engineering (March 05)
- Previous Courses
Some Recent Tutorials, Short Courses and Invited Talks
- Phasarum can compute shortest paths, WADS 2013, STACS 2013, College de France 2012, Hari Sahasrabuddhe Lecture on Inflections in Computing 2012
- 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