Thursday, February 7, 2013

[DMANET] APEX 2013 Call for papers

International Workshop on Approximation, Parameterized and EXact algorithms

APEX'2013
http://www.lamsade.dauphine.fr/apex2013
Satellite Workshop of ICALP 2013
July 6-7, 2013, Riga, Latvia

Call for papers

The APEX (Approximation, Parameterized and EXact algorithms) workshop is
supported by the French Agency of National Research (ANR) under the TODO
(Time versus Optimality in Discrete Optimization) ANR project
(http://todo.lamsade.dauphine.fr/). It aims at bringing together
researchers working on the design and analysis of algorithms (exact,
moderately exponential, approximation and low memory) for combinatorial
optimization problems.

Papers are solicited in all areas of approximation and exact algorithms,
including but not limited to:

- Exact and parameterized algorithms
- Moderately exponential and parameterized approximation algorithms
- Approximation, online and reoptimization algorithms
- Massive data computation
- Low memory and streaming algorithms
- Analysis and experimental evaluation of algorithms

The EasyChair system will be used for the abstracts submission. Abstracts
of 2-4 pages must be submitted via
https://www.easychair.org/conferences/?conf=apex13
using a pdf format. APEX submissions will undergo a selection process
based on a light refereeing by the Program Committee. APEX will not
publish proceedings. Hence, presenting your paper at APEX will not prevent
you from submitting it to journals or to other conferences. Similarly, it
is acceptable to submit a paper that has been presented at an earlier
conference. Submissions by PC members are allowed. Most talks will be 20
minutes long. Some submissions will be selected for 30 minutes talks.

APEX'2013 will be held in the University of Latvia, Riga, Latvia on July
6-7, 2013.

Invited speakers
Daniel Marx, Hungarian Academy of Sciences, Hungary
Maxim Sviridenko, University of Warwick, United Kingdom

Important Dates
Submission deadline: March 15, 2013
Notification: April 30, 2013

Program Committee
Eric Angel, Université d'Evry Val d'Essone, France
Evripidis Bampis, Université Pierre et Marie Curie, France (Chair)
Marc Demange, ESSEC, France
Bruno Escoffier, Université Paris-Dauphine, France
Aristotelis Giannakos, Université de Picardie Jules Verne, France
Gregory Gutin, Royal Holloway University of London, United Kingdom
Michael R.Fellows, Charles Darwin University, Australia
Fedor V. Fomin, University of Bergen, Norway
Klaus Jansen, University of Kiel, Germany
Christian Laforest, Université Blaise Pascal (Clermont Ferrand), France
Stefano Leonardi, Università di Roma "La Sapienza", Italy
Ioannis Milis, Athens University of Economics and Business, Greece
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Christophe Paul, Université du Montpellier, France
Hadas Schachnai, Technion, Israel
Frits Spieksma, University of Leuven, Netherlands

Local Organizing Committee
Bruno Escoffier, Université Paris-Dauphine, France (Chair)
Katerina Kinta, Université Paris-Dauphine, France
Dimitrios Letsios, Université Pierre et Marie Curie, France
Giorgio Lucarelli, Université Pierre et Marie Curie, France
Cecile Murat, Université Paris-Dauphine, France
Eleni Paléologou, Université Paris-Dauphine, France
Vangelis Paschos, Université Paris-Dauphine, France (Chair)
Florian Sikora, Université Paris-Dauphine, France




--
Vangelis Th. Paschos
LAMSADE, CNRS UMR 7243, University Paris-Dauphine and IUF
phone: + 33 1 44 05 45 82
http://www.lamsade.dauphine.fr/~paschos

**********************************************************
*
* 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/
*
**********************************************************