CALL FOR PAPERS - *New symposium dates!*
LAGOS'11 - VI Latin-American Algorithms, Graphs, and Optimization
Symposium
Hotel Edelweiss, Bariloche, Argentina
March 28 - April 1, 2011
http://www-2.dc.uba.ar/lagos2011 - lagos2011@dc.uba.ar
*IMPORTANT NOTICE*:
Due to unexpected events, we announce that the LAGOS 2011
will take place from March 28th to April 1st, 2011 (i.e., one week
before the original schedule).
Celebrating 30 years from the publication of M. Groetschel, L. Lovasz,
and A.Schrijver "The Ellipsoid Method and its Consequences in Combinatorial
Optimization" fundamental article.
LAGOS - Latin-American Algorithms, Graphs, and Optimization
Symposium, isthe 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.
Organization:
- 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
Conference themes:
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.
Applications: mathematical programming, combinatorial optimization,
continuous optimization, heuristics, and metaheuristics, applied to
real-world problems.
Invited speakers:
- Martin Groetschel (ZIB Berlin, Technische Universitaet Berlin, and
DFG-Forschungszentrum Matheon, Germany)
- Laszo Lovasz (U. Eotvos Lorand, Hungary)
- Guillermo Duran (UBA, Argentina and U. Chile, Chile)
- Abilio Lucena (UFRJ, Brazil)
- Martin 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.
_______________________________________________
Lagos2011-PC mailing list
Lagos2011-PC@dc.uba.ar
https://listas.dc.uba.ar/cgi-bin/mailman/listinfo/lagos2011-pc
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
