IX Latin and American Algorithms, Graphs and Optimization Symposium
September 11 – 15, 2017
Liliana Alcón (UNLP, Argentina)
Graciela Nasini (UNR, Argentina)
Miguel Pizaña (UAM, Mexico)
Lionel Pournin (Université Paris 13) (co-chair)
Bernard Ries (Fribourg, Switzerland)
Gelasio Salazar (UASLP, Mexico)
Rudini Sampaio (UFC, Brazil)
Oliver Schaudt (Cologne, Germany)
Gautier Stauffer (G-Scop, France)
Maya Stein (UChile, Chile)
Nicolás Stier (Facebook, USA)
Mario Valencia-Pabon (Université Paris 13) (co-chair)
Juan Carlos Vera Lizcano (Tilburg University) (co-chair)
Annegret Wagler (Clermont, France)
Luis Fernando Zuluaga (Lehigh University, USA)
The main goal of the LAGOS international conference (Latin-American Algorithms, Graphs, and Optimization Symposium) is to bring together researchers from the domains of combinatorial optimization, graph theory, and operations research.
LAGOS is an international conference that takes place every two years. It is attended by confirmed researchers as well as young researchers. Most participants are from South America (Brazil, Chili, Argentina), North America (United States, Canada, Mexico), and Europe (almost every European country, including western and eastern Europe).
The conference features a dozen plenary lectures given by invited speakers of very high international level, as well as around sixty talks selected among some 150 to 200 submissions. The selection is conducted by the scientific committee of the conference, based on one or several reports written by specialists on every submission.
This LAGOS’2017 edition will be the occasion to celebrate the 75th birthday of two prominent personalities, who were among the founders of the conference : Jayme Luis Szwarcfiter (Professor Emeritus at the Federal University of Rio de Janeiro, Brazil) and Thomas Liebling (Honorary Professor of the École polytechnique fédérale de Lausanne (EPFL), Switzerland). These two researchers have been at the core of the community for many years. They have contributed in a remarkable way to the strengthening of the links between Europe (in particular, France) and Latin America, in the domains of combinatorial optimization, graph theory, and operations research.
From LAGOS in Latin America to LAGOS in France
Historically, the LAGOS conference was born from the reunion of two Latin American conferences : the Brazilian Symposium on Graphs, Algorithmics, and Combinatorics (GRACO) and the Latin-American conference on combinatorics, graphs, and applications (LACGA). The last editions of LAGOS took place in Puerto Varas, Chili (LAGOS 2007), Gramado, Brazil (LAGOS 2009), Bariloche, Argentina (LAGOS 2011), Playa del Carmen, Mexico (LAGOS 2013), and Praia das Fontes, Brazil (LAGOS 2015). The 2017 edition will take place for the first time in France, a Latin country that contributed in an outstanding way to the developpement of sciences in Latin-American countries. LAGOS is a forum where the last results obtained through international collaboration between its participants can be shared and exposed. This conference also allows to establish new bilateral projets between researchers of different continents. Within the scientific themes of LAGOS, France is one of the countries that has the largest number of collaborations with Latin-America.
Maria Chudnovsky (Princeton University) Coloring graphs with forbidden induced subgraphs (abstract)
Christoph Dürr (Université Pierre et Marie Curie) An adversarial model for optimization and testing
Marcos Kiwi (University of Chile) The Random Hyperbolic Graph Model
Monique Laurent (Tilburg University & University of Amsterdam) Combinatorial and algorithmic properties of Robinsonian matrices
Claudia Linhares-Sales (University of Fortaleza) b-colorings: an structural overview
Martin Milanic (Koper University) Reconstructing perfect phylogenies via binary matrices, branchings in DAGs, and a generalization of Dilworth’s theorem
Fabio Protti (Fluminense Federal University, Brazil) A general framework for path convexities
Dieter Rautenbach (Universität Ulm) Restricted Types of Matchings
Martin Safe (General Sarmiento National University) Forbidden subgraphs of some graphs representable by arcs on a circle
Alexander Schrijver (University of Amsterdam) The Partially Disjoint Paths Problem
András Sebő (Laboratoire G-SCOP Grenoble) Matroids and Polyhedra for Approximating the Traveling Salesman Problem