Universidade Federal do Rio de Janeiro COPPE
Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia
Instituto de Matemática
Data: Monday, November 01, 2010 At 08:00
Duração: Todo dia
LAGOS'11 - VI Latin-American Algorithms, Graphs, and Optimization Symposium
Hotel Edelweiss, Bariloche, Argentina
April 4-8, 2011
http://www-2.dc.uba.ar/lagos2011 - firstname.lastname@example.org
Celebrating 30 years from the publication of M. Grötschel, L. Lovász, and A. Schrijver "The Ellipsoid Method and its Consequences in Combinatorial Optimization" fundamental article.
LAGOS - Latin-American Algorithms, Graphs, and Optimization Symposium, is the union of two Latin-American Conferences on these subjects: the GRACO - Brazilian Symposium on Graphs, Algorithms, and Combinatorics and the LACGA - Latin-American Conference on Combinatorics, Graphs, and Applications.
The previous editions were held in Fortaleza, Brazil (2001), Santiago, Chile (2004), Angra dos Reis, Brazil (2005), Puerto Varas, Chile (2007), and Gramado, Brazil (2009). The proceedings of the accepted papers were published in Electronic Notes in Discrete Mathematics, and special editions of Discrete Applied Mathematics were dedicated to refereed full papers from these events.
- Computer Science Department, School of Natural and Exact Sciences, University of Buenos Aires, Argentina
- Sciences Institute, National University of General Sarmiento, Argentina
- Laboratoire d'Informatique, Paris-Nord University, France
Themes include, but are not limited to, the following AMS classification:
Algorithms: analysis of algorithms; approximation algorithms; randomized algorithms;
Operations Research and Mathematical Programming: combinatorial optimization; integer programming; polyhedral combinatorics; operations research and management science;
Graph Theory: cliques, dominating and independent sets; coloring of graphs and hypergraphs; covering and packing, factorization, matching; digraphs, tournaments; graph algorithms; graphs and matrices; hypergraphs; perfect graphs; random graphs; structural characterization of types of graphs.
- Martin Grötschel (ZIB Berlin, Technische Universität Berlin, and DFG-Forschungszentrum Matheon, Germany)
- László Lovász (U. Eötvös Loránd, Hungary)
- Maria Chudnovsky (Columbia University, USA)
- Guillermo Durán (UBA, Argentina and U. Chile, Chile)
- Abílio Lucena (UFRJ, Brazil)
- Martín Matamala (U. Chile, Chile)
- Gianpaolo Oriolo (U. Tor Vergata, Italy)
- Gautier Stauffer (U. Bordeaux 1, France)
Deadline for Submissions and Author Notification:
Submissions are due November 1st, 2010. Authors are invited to submit an extended abstract in English (up to 6 pages). A special volume of the Electronic Notes in Discrete Mathematics will be dedicated to accepted extended abstracts. Instructions for submission preparation may be obtained in the ENDM web page (www.elsevier.com/locate/endm). Submission instructions can be found at the symposium web page.
Acceptance/rejection notices will be sent to authors via e-mail by January 31st, 2011. A special issue of Discrete Applied Mathematics will be devoted to selected full papers from the symposium upon refereeing.