Twelve mini-courses of approximately five hours each
will be presented during the school. They will be divided according to
the following program:
See the preliminary
program!
First week (12th - 16th March, 2001)
- Bruce
Reed, Tree decomposition. Equipe Combinatoire de Paris VI,
France.
- Cláudio
Lucchesi, The matching lattice. University of Campinas, Brazil.
- Colin
McDiarmid, The frequency allocation problem. University of
Oxford, UK.
- Frédéric
Maffray, Perfect graph coloring. Laboratoire Leibniz - IMAG,
France.
- Jayme
Szwarcfiter and Victor Neumann-Lara, On clique
graphs. Federal University of Rio
de Janeiro, Brazil and Universidad Autonoma de
Mexico, Mexico.
- Michel Habib, New trends
for graph algorithms.
University of Montpellier, France.
Second week (21st - 24th March, 2001)
- László
Lovász, Semidefinite programs
and combinatorial optimization. Microsoft, USA.
- W. R. Pulleyblank, Practical applications
of combinatorial optimization. IBM, USA.
- Angelika
Steger, Hardness of approximation. University of Munich,
Germany.
- Yoshiharu Kohayakawa,
Probabilistic methods. University of São Paulo, Brazil.
- Yoshiko Wakabayashi and
Marie-France
Sagot, Pattern inference under many guises. University of
São Paulo, Brazil and Institut Pasteur, France.
Invited talk in the second week
Nelson
Maculan and Márcia Fampa, The n-dimensional Steiner tree
problem. Federal University of Rio de Janeiro, Brazil.
|