Thursday, February 23, 2012

[DMANET] ESA 2012 - call for papers


ESA 2012
20th European Symposium on Algorithms

Ljubljana, Slovenia
September 10-12, 2012


The European Symposium on Algorithms (ESA) is one of the premier
conferences on algorithms. The symposium covers research in all
aspects of the design, analysis, and application of algorithms and
data structures. ESA 2012 has two tracks: the Design and Analysis
Track (Track A) and the Engineering and Applications Track
(Track B). The symposium seeks original algorithmic contributions
for problems with relevant theoretical and/or practical
applications: papers with a strong emphasis on the theoretical
analysis of algorithms should be submitted to Track A, while papers
reporting on the results of extensive experimental evaluations
and/or providing original contributions to the engineering of
algorithms for practical applications should be submitted to
Track B. ESA 2012 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2012.


Papers presenting original research in all areas of algorithmic
research are sought, including but not limited to:

- Algorithm engineering
- Algorithmic aspects of networks
- Algorithmic game theory
- Approximation algorithms
- Computational biology
- Computational finance
- Computational geometry
- Combinatorial optimization
- Data compression
- Data structures
- Databases and information retrieval
- Distributed and parallel computing
- Graph algorithms
- Hierarchical memories
- Heuristics and meta-heuristics
- Mathematical programming
- Mobile computing
- On-line algorithms
- Parameterized complexity
- Pattern matching
- Quantum computing
- Randomized algorithms
- Scheduling and resource allocation problems
- Streaming algorithms.


Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix.

* Papers must be formatted in LaTeX, using the LNCS style file
(available through the conference website). The maximum length of
the paper (including references, but excluding the optional
appendix) is 12 pages. Do not change the margin size or the font, do
not make a separate title page, etc.: use the LNCS style file
as given, but please do add page numbers, which can be done,
for example, by adding


just before

* Proofs omitted due to space constraints must be placed in an
appendix to be read by the program committee members at their

These guidelines are strict: papers failing to adhere to the
guidelines (by not providing the omitted proofs in an appendix,
being more than 12 pages, or not being in LNCS format) will be
rejected without consideration of their merits.

Papers should be submitted electronically via the EasyChair
submission system, accessible via the conference website, using
the link of the appropriate track. Simultaneous submission to
other conferences with published proceedings, or to both tracks
of ESA 2012, is not permitted. There will be a Best Student Paper
Award, as well as a Best Paper Award. The ESA proceedings will be
published in the Lecture Notes in Computer Science series by
Springer-Verlag. Each accepted paper will be allotted 12 pages in
the proceedings.


* Submission deadline: Sunday, April 22, 2012, 20:00 GMT (22:00 CEST,
23:00 IDT)
* Notification: Sunday, June 17, 2012
* Final version due: Tuesday, July 1, 2012
* Symposium: September 10-12, 2012 (Ljubljana, Slovenia)


Jiri Sgall, Charles University in Prague

Yossi Matias, Google and Tel-Aviv University


ESA 2012 will be co-located with IPEC (7th International Symposium
on Exact and Parameterized Computing, September 13-14), WABI (12th
Workshop on Algorithms in Bioinformatics, September 10-12), ATMOS
(12th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 13), WAOA (10th
Workshop on Approximation and Online Algorithms, September 13-14),
ALGOSENSORS (8th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 13-14), and MASSIVE (4th Workshop on Massive Data Algorithmics,
September 13).


o Leah Epstein (chair), University of Haifa, Israel
o Matthias Englert, University of Warwick, United Kingdom
o Gregory Gutin, University of London, United Kingdom
o Pinar Heggernes, University of Bergen, Norway
o Martin Hoefer, RWTH Aachen University, Germany
o Jochen Koenemann, University of Waterloo, Canada
o Petr Kolman, Charles University, Czech Republic
o Kim Skak Larsen, University of Southern Denmark, Denmark
o Asaf Levin, The Technion, Israel
o Alejandro Lopez-Ortiz, University of Waterloo, Canada
o Krzysztof Onak, Carnegie Mellon University, USA
o Dror Rawitz, Tel-Aviv University, Israel
o Guenter Rote, Freie Universitaet Berlin, Germany
o Andreas Schulz, Massachusetts Institute of Technology (MIT), USA
o Ola Svensson, EPFL Lausanne, Switzerland
o Marc Uetz, University of Twente, The Netherlands
o Carola Wenk, University of Texas at San Antonio, USA
o Peter Widmayer, ETH Zurich, Switzerland
o Christian Wulff-Nilsen, University of Southern Denmark, Denmark
o Raphael Yuster, University of Haifa, Israel


o Paolo Ferragina (chair), University of Pisa, Italy
o Susanne Albers, Humboldt University, Berlin, Germany
o Alexandr Andoni, Microsoft Research Silicon Valley, USA
o Ioannis Z. Emiris, National Kapodistrian University of Athens, Greece
o Irene Finocchi, Sapienza University of Rome, Italy
o Johannes Fischer, Karlsruhe Institute of Technology, Germany
o Michael T. Goodrich, University of California, Irvine, USA
o Herman Haverkort, Eindhoven University of Technology, The Netherlands
o Vahab Mirrokni, Google Research, USA
o Gonzalo Navarro, University of Chile, Chile
o Rina Panigrahy, Microsoft Research Silicon Valley, USA
o Rajeev Raman, University of Leicester, United Kingdom
o Jens Stoye, Bielefeld University, Germany
o Oren Weimann, University of Haifa, Israel
o Ke Yi, Hong Kong University of Science and Technology, China


o Andrej Brodnik (chair)
o Borut Robic (co-chair)
o Uros Cibej
o Gasper Fele-Zorz
o Matevz Jekovec
o Jure Mihelic

* Contributions to be spread via DMANET are submitted to
* 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.