Algorithms and Combinatorics

Location

FORTALEZA
,
Brazil

Dates

to

Presentation

Combinatorics plays an important role as a mathematical tool in diverse fields such as computer science, applied mathematics, operational research, biology, chemistry, etc. Many problems in these sciences can be formulated using combinatorial models. The analysis of these models often yields algorithms to solve such problems. The main aim of the Summer School is to explore this close relationship between combinatorics and algorithms. The lectures are intended to give the state of art in algorithms and combinatorics, in both aspects: Theory(graph theory, complexity theory, probabilistic methods, partially ordered sets) and Pratice (combinatorial optimization, routing, frequency allocation problem, microbiology).

Administrative and scientific coordinators

Claudia Linhares Sales (Federal University of Cearé,
Brazil
, )
Bruce Reed (CNRS,
France
, )

Scientific program

Course 1: "Semidefinite programs and combinatorial optimization", Laszlo Lovasz (Microsoft, USA)

Course 2: "Hardness of approximation", Angelika Steger (University of Munich, Germany)

Course 3: "Tree decomposition", Bruce Reed (CNRS, France)

Course 4: "The Matching Lattice", Claudio Lucchesi (UNICAMP University, Brazil)

Course 5: "Perfect graph coloring", Frédéric Maffray (CNRS, France)

Course 6: "On clique graphs", Jayme Szwarcfiter (Federal University of Rio de Janeiro, Brazil)

Course 7: "Partially Ordered Sets", Michel Habib (University of Montpellier, France)

Course 8: "Probabilistic methods", Yoshiharu Kohayakawa (University of Sao Paulo, Brazil)

Course 9: "Applied Combinatorial Optimization", W. R. Pulleyblank (IBM, USA)

Course 10: "Frequency Allocation Problem", Colin McDiarmid (University of Oxford, UK)

Course 11: "Pattern Inference under many guises", Yoshiko Wakabayashi (University of Sao Paulo, Brazil) and Marie-France Sagot (Institut Pasteur, France)

Website of the school

How to participate