[DMANET] CIAC 2013: Deadline extended to November 9th

The paper submission deadline for the CIAC 2013 conference has been
extended to

** November 9, 2012 **

Please note that there will be NO further deadline extensions.


** Apologies for multiple copies **



*** Call for papers ****

8th International Conference on Algorithms and Complexity (CIAC 2013)
May 22-24, 2013 Barcelona, Spain


Aim and Scope

The 8th International Conference on Algorithms and Complexity is
intended to provide a forum for researchers working in all aspects of
computational complexity and the use, design, analysis and
experimentation of efficient algorithms and data structures.

Topics

Papers presenting original research in the areas of algorithms and
complexity are sought, including (but not limited to):

· sequential, parallel and distributed algorithms and data structures;
· approximation and randomized algorithms;
· graph algorithms and graph drawing;
· on-line and streaming algorithms;
· analysis of algorithms and computational complexity;
· algorithm engineering;
· web algorithms;
· algorithmic game theory;
· computational biology;
· communication networks;
· computational geometry;
· cryptography;
· discrete optimization.

Submission Guidelines

Authors are invited to submit an extended abstract of at most 12 pages
(LNCS style) to arrive before November 5, 2012. Submission is handled
by EasyChair at the following web page:
http://www.easychair.org/conferences/?conf=ciac2013

Further information and submission details can be found on the
Conference web page.
http://albcom.lsi.upc.edu/ciac2013

Simultaneous submissions to other conferences with published proceedings
are not allowed.

Proceedings

The conference proceedings will be published by Springer-Verlag in
Lecture Notes in Computer Science (LNCS) series.

Important Dates

Deadline for submission Extended to: November 9, 2012
Notification of acceptance: December 20, 2012 .
Final manuscript due: January 20, 2013.
Conference: May 22-24, 2013.


Program Committee

Paul G Spirakis (Chair) (Patras U and CTI)
Helmut Alt (Free Univ Berlin)
Tiziana Calamoneri (Sapienza Univ. of Rome)
Ioannis Chatzigiannakis (Patras U and CTI)
Shlomi Dolev (Ben Gurion)
Sandor Fekete (Braunschweig U of Technology)
Dimitris Fotakis (NTUA Athens)
Kazuo Iwama (Kyoto U)
Christos Kaklamanis (U Patras and CTI)
Rajgopal Kannan (Louisiana State U)
Alexis Kaporis (U Aegean)
Stefano Leonardi (Sapienza Univ. of Rome)
Alberto Marchetti-Spaccamela (Sapienza Univ. of Rome)
George Mertzios (Durham U)
Othon Michail (CTI)
Friedhelm Meyer auf der Heide (U Paderborn and Heinz-Nixdorf Inst)
Sotiris Nikoletseas (Patras U and CTI)
Vangelis Paschos (U Paris - Dauphine)
Giuseppe Persiano (U Salerno)
Jose Rolim (U Geneva)
Branislav Rovan (Comenius U)
Maria Serna (co-Chair) (TU Catalonia)
Emo Welzl (ETH)


Steering Committee

Giorgio Ausiello (Sapienza Univ. of Rome)
Josep Díaz (TU Catalonia)
Rossella Petreschi (Sapienza Univ. of Rome)

Organizing Committee

Maria Serna (Chair) (TU Catalonia)
Carme Àlvarez (TU Catalonia)
Maria Blesa (TU Catalonia)




**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************