6th Conference on Algorithms and Complexity
May 29-31, 2006 Rome, Italy

Call for papers

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.


Papers are solicited describing original results in all areas of
algorithmic research including, but not limited to:

Invited Speakers 

Program Committee 


Organizing Committee 

Nicola Galesi, Univ. of Rome "La Sapienza", Italy   T. Calamoneri (Chair, Rome - Italy)
John Iacono, Brooklyn Polytechnic, USA   S. Caminiti (Rome - Italy)
Giuseppe F. Italiano (Chair), Univ. of Rome "Tor Vergata", Italy   F. Dellutri (Rome - Italy)
Pascal Koiran, ENS Lyon, France   I. Finocchi (Rome - Italy)
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

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. Simultaneous submissions to other conferences with published proceedings are not allowed.


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

Fax: +39-06-8541842
E-mail: ciac@di.uniroma1.it

Computer Science Department home page