São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization (SPSAS-ACO)
The school was organized by the Theory of Computing, Combinatorics, and Optimization group of the Department of Computer Science at IME-USP and made possible by the São Paulo Research Foundation (FAPESP) under the SPSAS program.
The school aimed at providing an opportunity for graduante and undergraduate students as well as young researchers to get together and attend advanced courses and talks on current topics in the fields of algorithms, combinatorics, and optimization.
In the two weeks of the school, 11 advanced courses and 7 talks were delivered by renowned researchers from abroad and from Brazil. The school was intended to be a forum for discussions and new collaborations.
Besides the courses and talks, a number of poster sessions were planned. Supporting material for the courses was provided by the lecturers, and students worked on the material and on exercises. Each of the lecturers had an assistant, who assisted the students during classwork.
Instituto de Matemática e Estatística / USP
Field of Knowledge
2016-07-18 to 2016-07-29
Mathematics, Algorithms, Combinatorics, Optimization
Courses and talks
There will be two weeks of courses, as well as talks.
Sample complexity and uniform convergence, by Eli Upfal (Brown, USA)
The regularity method and blow-up lemmas for sparse graphs, by Yoshiharu Kohayakawa (USP, Brazil)
Combinatorial stochastic search and selection, by Robert Kleinberg (Cornell, USA)
The perfect matching polytope, solid bricks and the perfect matching lattice, byCláudio L. Lucchesi (UFMS, Brazil)
Recent progress in approximation algorithms for the traveling salesman problem, byDavid Williamson (Cornell, USA)
Harmonic analysis on polytopes and cones, by Sinai Robins (USP, Brazil)
Coloring sparse graphs with few colors, by Alexandr Kostochka (UIUC, USA)
The method of hypergraph containers, by Rob Morris (IMPA, Brazil)
Graph limits and their applications in extremal combinatorics, by Daniel Král(Warwick, UK)
Geometric Packing , consisting of two parts:
Part I: Approximation algorithms for packing circles, by Flávio Keidi Miyazawa (UNICAMP, Brazil)
Part II: Upper bounds for geometric packing problems, by Fernando Mário de Oliveira Filho (USP, Brazil)
Semidefinite programming techniques in combinatorial optimization, by Levent Tunçel (Waterloo, Canada)
Solving NP-hard geometric optimisation problems to optimality, Cid Carvalho de Souza (UNICAMP, Brazil)
Efficient polynomial time approximation schemes for scheduling and packing problems, Klaus Jansen (University of Kiel, Germany)
Adaptive rumor spreading, Marcos Kiwi (Universidad de Chile, Chile)
Random models of 21st century networks and their connectivity structure, Bruce Reed (McGill, Canada)
Determining the rank of some graph convexities, Jayme L. Szwarcfiter (UFRJ, Brazil)