Friday
Saturday
SCOPE
The workshop is intended to be a forum for researchers working on all aspects of algorithms and complexity. Possible topics include, but are not limited to
-Algorithm Design and Analysis
-Computational Complexity
-Randomized Algorithms
-Algorithmic Graph Theory
-Combinatorial Algorithms
-Approximation Algorithms
-Applications of Algorithms
-Constraint Satisfaction
-Exact and Parameterized Computation
-Proof Complexity
-Databases and Information Retrieval
-Quantum Computing
-Discrete Optimization
-----------------------------------------------------------
FORMAT
The program consists of three parts.
INVITED LECTURES
-Michael Fellows (University of Newcastle, Australia) -Pavel Pudlk (Academy of Sciences of the Czech Republic) -Carsten Thomassen (Technical University of Denmark)
CONTRIBUTED PAPERS
We invite submission of extended abstracts (up to 10 pages) to be presented at
the workshop and for publication in the Proceedings. Extended
abstracts will be reviewed and
the Proceedings will be published in the Texts in Algorithmics series of KCL publications; see http://www.dcs.kcl.ac.uk/kcl-publications/alg/.
Selected papers will also be considered for full paper versions in a special volume of the Journal of Discrete Algorithms.
Deadline for submission of extended abstracts: 18 March 2005
Notification: 2 May 2005
CONTRIBUTED TALKS
We also invite submission of short abstracts (1 page) of talks to be presented at the workshop.
Deadline for submission of short abstracts: 6 June 2005
During the workshop, a total of up to 40 papers will be presented in a series of non-parallel sessions. Talks, other than the invited lectures, will be 30 minutes in length.
-----------------------------------------------------------