Speakers of the Course


Paolo Boldi, University of Milan, IT

Link Analysis, ranking, centralities, and large graphs

Shiri Chechik, Tel-Aviv University, IL

Dynamic Algorithms

Giuseppe F. Italiano, University of Rome 'Tor Vergata', IT

2-Connectivity in Directed Graphs

Jon Lee, University of Michigan, Ann Arbor, MI, US

A geometric view of some relaxations in non-convex optimization

Andrea Lodi, Polytechnique Montréal, QC, CA

On big data, learning and mathematical optimization

Carlo Mannino, Sintef ICT, University of Olso, NL

Benders' reformulation for job-shop scheduling problems in transportation

Piotr Sankowski, University of Warsaw, PL

Matchings in Graphs

Martin Skutella, Technische Universität Berlin, DE

Flows over time and submodular function minimization

Maria Grazia Speranza, Claudia Archetti, University of Brescia, IT

Trends in graph applications to transportation and logistics

Ola Svensson, École Polytechnique Fédérale de Lausanne, CH

Algorithms with Provable Guarantees  for Clustering

Robert Tarjan, Intertrust, CA and Princeton University, NJ, US

New Results and Open Problems in Data Structures

Paolo Toth, University of Bologna, IT

Metaheuristic Algorithms for Location-Routing Problems