ESA 2002

[Rolf Moehring]

                      PRELIMINARY CALL FOR PAPERS

                              ESA 2002
             10th Annual European Symposium on Algorithms
        University of Rome "La Sapienza", 17-21 September, 2002.
                                   
SCOPE

  The Symposium covers research in efficient algorithms and data structures
  in computer  science,  discrete applied mathematics,  operations research
  and mathematical  programming.  The symposium has two tracks,  which deal
  respectively with:

  o the design  and  mathematical  analysis of  algorithms (the "Design and
    Analysis" track);

  o real-world  applications,  engineering   and  experimental  analysis of
    algorithms (the "Engineering and Applications" track).

  ESA 2002 is sponsored by EATCS  (the European Association for Theoretical
  Computer Science)  and jointly organized with WABI 2002,  APPROX 2002 and
  ARACNE 2002 in the context of ALGO 2002.

TOPICS

  Papers presenting  original research in all areas of algorithmic research
  are  sought,  including  but  not  limited  to:    Computational Biology;
  Computational Finance;  Computational Geometry; Databases and Information
  Retrieval;   External-Memory  Algorithms;  Graph and Network  Algorithms;
  Graph Drawing;  Machine Learning;   Network Design;   On-line Algorithms;
  Parallel  and  Distributed   Computing;     Pattern  Matching  and   Data
  Compression;  Quantum  Computing;   Randomized  Algorithms  and  Symbolic
  Computation.   The algorithms may be sequential, distributed or parallel.

  Submissions  are   especially  encouraged  in   the areas of mathematical
  programming and operations research, including: Approximation Algorithms,
  Branch-and-Cut   Algorithms,    Combinatorial    Optimization,    Integer 
  Programming,   Network  Optimization,    Polyhedral  Combinatorics    and
  Semidefinite Programming.

SUBMISSIONS

  Authors are  invited to submit an  extended abstract or  full paper of at
  most 12 pages.   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 put  into an
  appendix to be read by the program committee members at their discretion.
  Electronic submission is highly recommended. Detailed information will be
  available on the ESA 2002 web site.    In case of problems with access to
  internet,  it  is  possible  to  submit six  copies of  the  paper to the
  appropriate program committee chair to arrive by 5PM local time:

  ESA 2002 (Design and Analysis Track) 
  Rolf Moehring
  Sekr. MA 6-1, Institut fuer Mathematik
  Fakultaet II: Mathematik und Naturwissenschaften
  Technische Universitaet Berlin
  Strasse des 17. Juni 136
  D-10623 Berlin, Germany 

  ESA 2002 (Engineering and Applications Track)
  Rajeev Raman
  Department of Maths and Computer Science
  University of Leicester
  University Road
  Leicester LE1 7RH, UK
  
  Simultaneous submission to other  conferences with published proceedings,
  or to both tracks of ESA 2002,  is not permitted.    A paper submitted to
  one track of  ESA 2002  may be switched  to  the  other track if,  in the
  opinion of the PC chairs, the paper is better suited to the other track.
  
  ESA 2002 offers the "EATCS award for the best student paper at ESA 2002".
  Please indicate  "student paper"  on the front page of the submission, if
  all authors are students.

IMPORTANT DATES

      Submission deadline             April 15, 2002
      Notification to authors           May 31, 2002
      Final versions due               June 26, 2002
      Symposium                September 17-21, 2002

PROCEEDINGS

  Accepted papers will be published in the Springer series Lecture Notes in
  Computer Science. Previous proceedings of ESA, 1999 in in Prague, 2000 in
  Saarbruecken and 2001 in Aarhus,  appeared as LNCS 1643, 1879  and  2161.
  Previous proceedings of the precursor to the Engineering and Applications
  track,  the  Workshop on  Algorithm  Engineering, held in 1999 in London,
  2000 in Saarbruecken and 2001 in Aarhus,  appeared as LNCS 1668, 1982 and
  2141.   Accepted contributed papers will receive an allotment of 12 pages
  in the proceedings.

  It  is  expected  that  all  accepted  papers  will  be  presented at the
  symposium by one of the authors.

PROGRAM COMMITTEES

Design and Analysis Track

Susanne Albers (Freiburg, Germany)
Stephen Alstrup (Copenhagen, Denmark)
Janos Csirik (Szeged, Hungary)
Thomas Erlebach (Zurich, Switserland)
Sandor Fekete (Braunschweig, Germany)
Lisa Fleischer (Pittsburgh, USA)
Kazuo Iwama (Kyoto, Japan)
Alberto Marchetti-Spaccamela (Rome, Italy)
Rolf Moehring (Berlin, Germany, chair)
Gunter Rote (Berlin, Germany)
Andreas Schulz (Cambridge, USA)
Jiri Sgall (Prague, Czech republic)
Christos Zaroliagis (Patras, Greece)
Uri Zwick (Tel Aviv, Israel)

Engineering and Applications Track

Karen Aardal (Utrecht, Netherlands)
Camil Demetrescu (Rome, Italy)
Olivier Devillers (Sophia Antipolis, France)
Thomas Liebling (Lausanne, Switzerland)
Michael Mitzenmacher (Cambridge, USA)
David Mount (College Park, USA)
Matthias Mueller-Hannemann (Bonn, Germany)
S. Muthukrishnan (Florham Park, USA)
Petra Mutzel (Vienna, Austria)
Rajeev Raman (Leicester, UK, chair)
Peter Sanders (Saarbruecken, Germany)

ORGANIZING COMMITTEE (partial list)

Giorgio Ausiello (Rome, Italy)
Daniele Frigioni (L'Aquila, Italy)
Stefano Leonardi (Rome, Italy)
Alberto Marchetti-Spaccamela (Rome, Italy)

-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.