IPCO 2011:

None


IPCO 2010:

None


IPCO 2008 summer school:

Michele Conforti:
Extended Formulations in Integer Programming and Combinatorial Optimization 

Franz Rendl:
Solution methods for SDP arising from combinatorial optimization problems

Martin Skutella:
Dynamic Network Flows


IPCO 2007 summer school:

??? 


IPCO 2005 summer school:

Martin Dyer:
Approximate Counting.

Daniel Spielman:
Fast, Randomized Algorithms for Partitioning, Sparsification, and the Solution of Linear Systems.

Jiri Matousek:
Generalized Linear Programming.


IPCO 2004 summer school:

Joan Feigenbaum:  
Incentives and Internet Computation.

Rakesh Vohra:  
Linear Inequalities and Mechanism Design.

Tim Roughgarden:  
The Price of Anarchy.


IPCO 2002 summer school:

Dimitris Bertsimas:
Robust Discrete Optimization.

Santosh Vempala:
Set-Pair Formulations for Network Design.

David Karger:
Randomized Algorithms for Cut and Flow Problems.


IPCO 2001 summer school:

EÉva Tardos: 
- Techniques for approximation algorithms: Local search for a classification problem related to multi-way cuts. 
- Approximation algorithms via linear programming: A general approach.
- Approximation algorithms via primal-dual method: Some clustering problems. 
- Approximation algorithms in a game theoretic setting.

Dan Bienstock:
- The maximum concurrent flow problem - a difficult combinatorial linear program that is easy to approximate.
- A survey of provably good methods for approximately solving linear programs.
- Oblivious rounding and derivatives.
- Computational experiments with approximation algorithms for linear programming -- survey and new results.