Welcome to the website of the São Paulo School of Advanced Science on Algorithms, Combinatorics and Optimization. The school is 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 (grant no. 2015/19068-0).
The school aims at providing an opportunity for graduate 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 will be delivered by renowned researchers from abroad and from Brazil. The school is intended to be a forum for discussions and new collaborations.
Besides the courses and talks, a number of poster sessions are planned. It is expected that supporting material for the courses will be provided by the lecturers, and it is planned that students will work on the material and on exercises. Each of the lecturers will have an assistant, who will assist the students during classwork.
This website is still under construction. Come back often for more information and material. For the moment, check out the preliminary program and schedule.
The school will take place at the Centro de Difusão Internacional of the University of São Paulo:
Centro de Difusão Internacional (map)
Avenida Prof. Lucio Martins Rodrigues, s/n
05508-020 São Paulo
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, by Cláudio L. Lucchesi (UFMS, Brazil)
- Recent progress in approximation algorithms for the traveling salesman problem, by David 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) – CANCELLED
- 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) – CANCELLED
- 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)
All participants should register (but first send the application form, even when no financial support is needed).
Early registration (until May 15th, 2016)
- R$ 200,00 (students) and R$ 300,00 (others) [may be deducted from the financial support].
- Alternatively, 50 US dollars (students) and 80 US dollars (others).
Late registration (deadline: June 1st, 2016)
- R$ 500,00.
The registration fee has to be paid either on July 17 or July 18, 2016. It covers coffee breaks, course material, etc.
Register by filling in this form.
Applications for funding are closed.
Any questions or comments? Contact us by email.