Second Algorithms and Complexity in Durham Workshop: ACiD 2006

Event Detail

General Information
Dates:
Monday, September 18, 2006 - Wednesday, September 20, 2006
Days of Week:
Monday
Tuesday
Wednesday
Target Audience:
Academic and Practice
Location:
Durham University
Sponsor:
Event Details/Other Comments:

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 programme consists of three parts.
INVITED LECTURES
* Jan Krajicek (Academy of Sciences of the Czech Republic, Prague)
* Alexander Schrijver (CWI, Amsterdam)
* Detlef Seese (AIFB, University of Karlsruhe)
* Berthold Vcking (RWTH, Aachen University)

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 College Publications (formerly KCL publications); see http://www.dcs.kcl.ac.uk/kcl-publications/
Selected papers will also be considered for full paper versions in a special volume of the Journal of Discrete Algorithms; see http://www.elsevier.com/wps/find/journaldescription.cws_home/672711/description#description
Deadline for submission of extended abstracts: 15 May 2006
Notification: 15 June 2006

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: 5 July 2006

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.