PDF Print E-mail

Speakers of the Course

You can download the file of the abstracts here

Giorgio Ausiello, "La Sapienza" University of Rome

Directed  Hypergraphs: Algorithms and Applications [SLIDES1] [SLIDES2] [SLIDES3]


Friedrich Eisenbrand, EPFL Lausanne, Switzerland

Graphs of Polytopes and the Simplex Algorithm [SLIDES]

Naveen Garg, Indian Institute of Technology, New  Delhi,India

Approximation Algorithms for graphical-TSP  [SLIDES]


Andrew V. Goldberg, Microsoft Research Silicon Valley, California

Shortest Paths in Road Networks [SLIDES] [EXERCISES]

Martine Labbé, Université Libre de Bruxelles, Belgium Bilevel  programming and price optimization problems [SLIDES]

Kurt Mehlhorn, Max-Planck Institut fuer Informatik, Germany

Natural Algorithms: Physarum Can Compute Shortest Paths

Giovanni Rinaldi, IASI-CNR, Rome, Italy

Polyhedral Approaches for Combinatorial optimization (the oracle paradigm) [SLIDES]

Maria Grazia Speranza, University of Brescia, Italy

Optimization in routing problems [SLIDES 1] [SLIDES 2]


Robert Tarjan, Princeton University and HP, Princeton, NJ 

Data Structures in Graph Algorithms [SLIDES]


Paolo Toth, University of Bologna, Italy

Models and Algorithms for Vertex Coloring Problems [SLIDES]

Dorothea Wagner, Karlsruhe Institute of Technology, Karlsruhe, Germany

Algorithm Engineering for Graph Clustering [ LECTURE EXERCISES HINTS ]