Logic List Mailing Archive

6th International Conference on Algorithms and Complexity (CIAC 2006), May 2006, Rome (Italy)

---------------------------------------------------------------------------
--

      6th Int. Conf. on Algorithms and Complexity (CIAC '06)
                  Rome, Italy, May 29-31, 2006

---------------------------------------------------------------------------
-

Aims and Scope of the Conference

The 6th Int. Conference on Algorithms and Complexity covers research in
all aspects of computational complexity and the use, design, analysis and
experimentation of efficient algorithms and data structures.


Topics

Papers are solicited describing original results in all areas of
algorithmic research including, but not limited to: sequential, parallel
and distributed algorithms, data structures, approximation algorithms,
randomized algorithms, on-line algorithms, graph algorithms, analysis of
algorithms, algorithm engineering, algorithmic game theory, computational
biology, computational complexity, communication networks, computational
geometry, cryptography, discrete optimization, graph drawing, mathematical
programming, quantum algorithms.


Invited Speakers

Kurt Mehlhorn (MPI, Germany)
Franco P. Preparata (Brown Univ., USA) 
Pavel Pudlak (Academy of Sciences, Czech Republic) 


Program Committee 

Nicola Galesi, Univ. of Rome "La Sapienza", Italy
John Iacono, Polytechnic Univ., USA
Giuseppe F. Italiano (Chair), Univ. of Rome "Tor Vergata", Italy
Pascal Koiran, ENS Lyon, France
Jaroslav Nesetril, Charles University, Czech Republic
Sotiris Nikoletseas, CTI and Univ. of Patras, Greece
Stephan Olariu, Old Dominion Univ., USA
Anna Ostlin Pagh, ITU, Denmark
Andrzej Pelc,  Universit? du Qu?bec en Outaouais, Canada
Peter Sanders, Universitaet Karlsruhe, Germany
Bruno Simeone, Univ. of Rome "La Sapienza", Italy
Uri Zwick, Tel-Aviv Univ., Israel


Organizing Committee 

T. Calamoneri (Chair, Rome - Italy)  
S. Caminiti (Rome - Italy)
F. Dellutri (Rome - Italy)
I. Finocchi (Rome - Italy)


Submission Guidelines

Authors are invited to submit an extended abstract of at most 12 pages to
arrive before December 11, 2005. Further information can be found on the
Conference Web page (http://www.dsi.uniroma1.it/~ciac/). Simultaneous
submission to other conferences with published proceedings is not allowed.


Proceedings

The proceedings volume will be published in the LNCS series by Springer
Verlag.

The Journal of Discrete Algorithms will publish a special issue devoted to
selected papers from CIAC 2006.


Important Dates

Deadline for submission: December 11, 2005
Notification of acceptance: February 13, 2006
Final manuscript due: March 12, 2006
Conference: May 29-31, 2006