WEA 2003
2nd International Workshop
on
Experimental and Efficient
Algorithms
26 - 28 May 2003, Monte Veritá,
Ascona, Switzerland
http://www.idsia.ch/wea2003
SCOPE:
The workshop is dedicated to the use, design and evaluation
of algorithms for combinatorial optimization problems (either efficient
optimal or efficient approximation algorithms) and to real-world
applications, engineering and experimental analysis of algorithms.
It aims, in particular, at fostering the cooperation
among researchers in computer science, discrete
mathematics, mathematical programming and
operations research.
The workshop, will take place at
Monte Veritá, Ascona from May 26 to 28, 2003.
WEA 2003 is the second workshop in a series after Riga.
TOPICS:
Papers presenting original research
in all areas of algorithmic research are sought, including,
but not limited to:
* computational complexity
* graph algorithms
*
network algorithms
* mobile computing
* flow and routing algorithms
* coloring and partitioning
* cuts and connectivity
* packing and covering
* scheduling algorithms
* approximation algorithms
* inapproximability results
* on-line problems
* randomized algorithms
* integer programming
* semidefinite programming
* algorithmic geometry
* polyhedral combinatorics
* branch and bound algorithms
* cutting plane algorithms
* real implementations
* performance evaluation
PUBLICATION:
Previous proceeding of WEA'2001 in Riga appeared
as LNCS 2138.
Proceedings of the workshop will be published in the
Springer series Lecture Notes in Computer Science
.
A subset of the selected papers will be invited for
publication in a special issue of
Theoretical Computer Science
.
SUBMISSION GUIDELINES:
Electronic submissions are solicited.
Submitted papers must be conform to the
LNCS style
. To submit
electronically a paper or for more specific
instructions about WEA, please consult:
http://www.idsia.ch/wea2003/submission.htm
The postscript file must be
received by 11:59pm (GMT) of
January 29th
(extended deadline) for your submission to be considered.
In extreme cases, contributions may
be submitted by sending 6 hard copies to:
Jose D.P. Rolim, WEA 2003
University of Geneva
Centre Universitaire d'Informatique
24, Rue General Dufour
1211 Geneve 4 - Switzerland
Your hard copy submission must be
received by January 15th
(or postmarked January 5th or earlier and
sent by airmail) in order to be considered.
Authors are invited to submit an
extended abstract of at most 12 pages (not counting the
references). An abstract should start with the
title of the paper, each author's name, affiliation,
and e-mail address, followed by a one paragraph summary
of the presented results. This should then be followed
by a technical exposition of the main ideas and techniques
used to achieve these results, including motivation
and a clear comparison with related work. Proofs
omitted due to space constraints must be put into
an appendix to be read by the program committee
members at the discretion.
Simultaneous submission to other
conferences with published proceedings is not allowed.
It is expected that all accepted papers will be
presented at the workshop.
IMPORTANT DATES:
Submissions: January 29 (extended deadline), 2003
Notifications: March 9, 2003
Camera Ready: March 16, 2003
Workshop: May 26 - 28, 2003
WORKSHOP CHAIRS:
Klaus Jansen, University of Kiel
(kj@informatik.uni-kiel.de)
Monaldo Mastrolilli, IDSIA Lugano
(monaldo@idsia.ch)
PROGRAM CHAIR:
Jose D.P. Rolim, University of Geneva
(jose.rolim@cui.unige.ch)
PROGRAM COMMITTEE:
J. Boyar, Odense
A. Broder, IBM
A. Clementi, Rome
A. Dandalis, Intel
A. Ferreira, Inria
A. Fiat, Tel Aviv
A. Goldberg, Microsoft
L. Gargano, Salerno
D. Johnson, AT&T
S. Nikoletseas, Patras
V. Prasanna, USC
C. Ribeiro, Rio de Janeiro
J. Rolim, Geneva, chair
P. Sanders, Max Planck
I. Schiermeyer, Freiberg
M. Serna, Barcelona
S. Skiena, New York
R. Solis-Oba, Waterloo
L. Trevisan, Berkeley
D. Trystam, Grenoble
E. Upfal, Brown
P. Widmayer, Zurich
For more information please contact
Klaus Jansen
(kj@informatik.uni-kiel.de
) or Monaldo
Mastrolilli (
).