Selected Topics in Algorithms

• Purpose of Course

  • We present recent developments in algorithms in a sequence of mini-courses.

  • Each mini-course is an independent unit.

  • The goal is to inform ourselves about recent developments and to introduce PhD-students and advanced master students into active areas of research.

  • The intended audience are advanced master students, PhD-students and above.

• Organisation

  • Each mini-course will consist of about 8 to 12 lectures of 45 minutes each.

  • The courses will be accompanied by discussion and/or exercise sessions.

  • The mini-courses will be taught by members and guests of AG1.

  • The courses take place Tuesday and Thursday, 1:30 pm to 3:00 pm in Room 024, MPI Building.

• Contents

  • Mini-Course 1: Kurt Mehlhorn: Geometric Rounding, Dates: April 9, 11, 23, 25

  • Mini-Course 2: Csanad Imreh: On-Line Algorithms Approx Dates: April 30, May 7, 14, 16

  • Mini-Course 3: Juha Kärkkäinen and Stefan Burkhardt: Filter Algorithms for Approximate String Matching Approx Dates: following Imreh's course, i.e., second half of May

  • Mini-Course 4: Naveen Garg: Combinatorial Algorithms for Linear Programming, Dates: the course starts on Thursday, June 6th.

  • Mini-Course 5: NN: NN, Approx Dates: second fortnight in June

  • Mini-Course 6: Christian Scheideler: Dynamic Networks, Dates: July 2, 4, 9, 11