posted by user: demetres || 4063 views || tracked by 17 users: [display]

ESA 2011 : European Symposium on Algorithms

FacebookTwitterLinkedInGoogle


Conference Series : European Symposium on Algorithms
 
Link: http://algo2011.mpi-inf.mpg.de/
 
When Sep 5, 2011 - Sep 7, 2011
Where Saarbruecken, Germany
Submission Deadline Apr 19, 2011
Notification Due Jun 17, 2011
Final Version Due Jul 9, 2011
Categories    algorithms   data structures   complexity   experiments
 

Call For Papers

--------------------------------------------------------------------
CALL FOR PAPERS

ESA 2011
19th European Symposium on Algorithms

Saarbruecken, Germany
September 5-7, 2011

http://algo2011.mpi-inf.mpg.de/

--------------------------------------------------------------------
GENERAL INFORMATION

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 2011 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 2011 is organized in collaboration with the European
Association for Theoretical Computer Science (EATCS) and is a part
of ALGO 2011.


--------------------------------------------------------------------
TOPICS

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

Algorithmic aspects of networks - Algorithmic game theory -
Approximation algorithms - Combinatorial optimization -
Computational biology - Computational finance - Distributed
algorithms - Computational geometry - Data compression - Data
structures - Databases and information retrieval - Graph algorithms
- Hierarchical memories - Machine learning - Mathematical
programming - Mobile computing - On-line algorithms - Parallel
algorithms - Parametrized complexity - Pattern matching - Quantum
computing - Randomized algorithms - Streaming algorithms.


--------------------------------------------------------------------
SUBMISSION GUIDELINES

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.: simply use the LNCS style file
as given.

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

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

Papers should be submitted electronically via the EasyChair
submission system, accessible via the conference website.
Simultaneous submission to other conferences with published
proceedings, or to both tracks of ESA 2011, 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 ARCoSS (Advanced Research
in Computing and Software Science) subline of LNCS (Lecture Notes in
Computer Science) series by Springer-Verlag.


--------------------------------------------------------------------
IMPORTANT DATES

* Submission deadline: Tuesday, April 19, 2011
* Notification: Friday, June 17, 2011
* Final version due: Friday, July 9, 2011
* Symposium: September 5-7, 2011 (Saarbruecken, Germany)


--------------------------------------------------------------------
MORE INFORMATION

ESA 2011 will be co-located with IPEC (6th International Symposium
on Exact and Parameterized Computing, September 5-7), WABI (11th
Workshop on Algorithms in Bioinformatics, September 5-7), ATMOS
(11th Workshop on Algorithmic Approaches for Transportation
Modelling, Optimization, and Systems, September 7), WAOA (9th
Workshop on Approximation and Online Algorithms, September 8-9), and
ALGOSENSORS (7th International Symposium on Algorithms for Sensor
Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities,
September 8-9).

WEBPAGE: http://algo2011.mpi-inf.mpg.de/

--------------------------------------------------------------------
PROGRAM COMMITTEE: DESIGN AND ANALYSIS TRACK

o Magnus M. Halldorsson (chair), Reykjavik University
o Therese Biedl, University of Waterloo
o Philip Bille, Technical University of Denmark
o Allan Borodin, University of Toronto
o Amr Elmasry, University of Copenhagen
o Sandor Fekete, TU Braunschweig
o Martin Furer, Penn State University
o Cyril Gavoille, University of Bordeaux
o Fabrizio Grandoni, University of Rome Tor Vergata
o Tao Jiang, UC Riverside
o Dieter Kratsch, University Paul Verlaine - Metz
o James R. Lee, University of Washington
o Daniel Lokshtanov, UC San Diego
o Pradipta Mitra, Reykjavik University
o Yoshio Okamoto, JAIST
o Guido Schaefer, CWI & VU University Amsterdam
o Danny Segev, University of Haifa
o Hadas Shachnai, Technion
o Cliff Stein, Columbia University
o Ileana Streinu, Smith College
o Takeshi Tokuyama, Tohoku University


--------------------------------------------------------------------
PROGRAM COMMITTEE: ENGINEERING AND APPLICATIONS TRACK

o Camil Demetrescu (chair), Sapienza University of Rome
o Umut Acar, Max Planck Institute for Software Systems
o Michael Bender, SUNY Stony Brook
o Alberto Caprara, University of Bologna
o Carlos Castillo, Yahoo! Research Barcelona
o Graham Cormode, AT&T Labs--Research
o Daniel Delling, Microsoft Research--Silicon Valley
o Thomas Erlebach, University of Leicester
o Rudolf Fleischer, Fudan University
o Monika Henzinger, University of Vienna
o Michael Juenger, University of Cologne
o Ian Munro, University of Waterloo
o Sotiris Nikoletseas, University of Patras and CTI
o Rasmus Pagh, IT University of Copenhagen
o Bettina Speckmann, TU Eindhoven


--------------------------------------------------------------------
ORGANIZING COMMITTEE

o Kurt Mehlhorn (chair), Max Planck Institute for Computer Science
o Christina Fries, Max Planck Institute for Computer Science
--------------------------------------------------------------------

Related Resources

COLT 2018   Computational Learning Theory
ECCV 2018   European Conference on Computer Vision
EuroCG 2018   European Workshop on Computational Geometry
COLT 2018   Conference on Learning Theory
NATP 2017   3rd International Conference on Natural Language Processing
EJEMS - 1 2018   The European Journal of Economics and Management Sciences
IJFCST 2017   International Journal in Foundations of Computer Science & Technology
MathSJ 2017   Applied Mathematics and Sciences: An International Journal
EJEAP - 1 2018   The European Journal of Education and Applied Psychology
EJA - 1 2018   The European Journal of Arts