17th Annual European Symposium on Algorithms (ESA)

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 algorithns 
• Combinatorial optimization 
• Computational biology 
• Computational finance 
• Distributed computing 
• 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 

Submissions

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

The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be placed in an appendix to be read by the program committee members at their discretion.

Papers must be submitted electronically, at http://www.easychair.org/conferences/?conf=esa2009, (the deadline has passed, the submssion server is now closed).

Simultaneous submission to other conferences with published proceedings, or to both tracks of ESA 2009, is not permitted. A paper will only be considered at the track where it was submitted. Authors are expected to present their accepted papers at the conference. ESA 2009 offers the EATCS award for the best student paper at ESA 2009. Please indicate “student paper” on the front page of the submission if all authors are students. ESA also offers the EATCS best paper award acknowledging the best ESA contribution of the year. 

Proceedings 

Accepted papers will be published in the Springer series Lecture Notes in Computer Science. Each paper will receive an allotment of 12 pages in the proceedings in LNCS-style.

Important dates

Submission: Sunday, 12 April 2009, 23:59 EST.

Notification: Monday, 1 June 2009

Final version due: Monday, 29 June 2009

Program committee

Design and Analysis Track

• Avrim Blum, Carnegie Mellon University 
• Ioannis Caragiannis, University of Patras 
• Debora Donato, Yahoo! Research Barcelona 
• Uriel Feige, Weizmann Institute of Science 
• Amos Fiat, Tel Aviv University (Chair) 
• Michal Feldman, Hebrew University 
• Pierre Fraigniaud, CNRS 
• Klaus Jansen, University of Kiel 
• Rohit Khandekar, IBM T. J. Watson Research Center 
• Alberto Marchetti-Spaccamela, U. of Rome “La Sapienza” 
• Adam Meyerson, UCLA 
• Seffi Naor, Technion 
• Ely Porat, Bar Ilan University 
• Piotr Sankowski, University of Warsaw 
• Jirí Sgall, Charles University, Prague 
• Martin Skutella, TU Berlin 
• Angelika Steger, ETH Zürich 
• Uli Wagner, ETH Zürich 
• Gerhard Woeginger, TU Eindhoven 

Engineering and Applications Track 

• Tetsuo Asano, JAIST 
• David Bader, Georgia Tech 
• Holger Bast, MPII Saarbrücken 
• Siavash Vahdati Daneshmand, University of Mannheim 
• Paolo Ferragina, University of Pisa 
• Giuseppe Italiano, U. of Rome “Tor Vergata” 
• Juha Kärkkäinen, University of Helsinki 
• Jyrki Katajainen, University of Copenhagen 
• Rolf Möhring, TU Berlin 
• Tomasz Radzik, King’s College London 
• Abhiram Ranade, IIT Bombay 
• Knut Reinert, FU Berlin 
• Kunihiko Sadakane, Kyushu University 
• Peter Sanders, University of Karlsruhe (Chair)