Passa ai contenuti principali

CIAC 2010 - Call for Papers: 7th International Conference on Algorithms and Complexity

CIAC 2010 
7th International Conference on Algorithms and Complexity
May 26-28, 2010 Rome, Italy

CALL FOR PAPERS
SUBMISSION DEADLINE: December 11, 2009

We apologize if you receive multiple copies of this message.


AIM AND SCOPE OF THE CONFERENCE:

The 7th 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 December 11, 2009. Submission is handled
by EasyChair at the following web page:
http://www.easychair.org/conferences/?conf=ciac2010

Further information and submission details can be found on the Conference
web page. 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.
Selected papers from CIAC 2010 will be invited to a special issue of Journal
of Discrete Algorithms.


IMPORTANT DATES:

Deadline for submission: December 11, 2009.
Notification of acceptance: February 13, 2010.
Final manuscript due: March 12, 2010.
Conference: May 26-28, 2010.


INVITED SPEAKERS:

- Ricardo Baeza-Yates, Yahoo! Research
- Monika Henzinger, Ecole Polytechnique Federale de Lausanne
- Eran Halperin, Tel Aviv Univ.
- Bruce Reed, McGill Univ.


STEERING COMMITTEE:

- Giorgio Ausiello, Sapienza Univ. of Rome
- Giuseppe F. Italiano, Univ. of Rome Tor Vergata
- Rossella Petreschi, Sapienza Univ. of Rome


PROGRAM COMMITTEE:

- Sandip Das, Indian Statistical Institute
- Josep Diaz (Chair), Univ. Politecnica de Catalunya
- Irene Finocchi, Sapienza Univ. of Rome
- Fabrizio Grandoni, Univ. of Rome Tor Vergata
- Kazuo Iwama, Kyoto Univ.
- Jan Kratochvil, Charles Univ.
- Kurt Mehlhorn, Max Planck Institut
- Dieter Mitsche, Univ. Politecnica de Catalunya
- Jarik Nesetril, Charles Univ.
- Vangelis Paschos, Univ. Paris-Dauphine
- Maurizio Patrignani, Univ. Roma Tre
- David Peleg, Weizmann Institute of Science
- Piotr Sankowski, Univ. of Warsaw
- Paul Spirakis, Univ. of Patras
- Geppino Pucci, Univ. of Padova
- Jared Saia, Univ. of New Mexico
- Dimitrios Thilikos, National and Kapodistrian Univ. of Athens
- Luca Trevisan, Univ. of California, Berkeley
- Lusheng Wang, City Univ. of Hong Kong
- Peter Widmayer, ETH Zurich


ORGANIZING COMMITTEE:

- Tiziana Calamoneri (Chair), Sapienza Univ. of Rome
- Saverio Caminiti, Sapienza Univ. of Rome
- Umberto Ferraro Petrillo, Sapienza Univ. of Rome
- Emanuele G. Fusco, Sapienza Univ. of Rome
- Maria Daniela Salvati, Sapienza Univ. of Rome

Commenti

Post popolari in questo blog

Digital Twin – Il caso Hyperloop

  Con il termine  hyperloop  si identificano una serie di tecnologie che promettono di rivoluzionare il trasporto di persone e cose. L’idea di base è molto semplice: far viaggiare all’interno di tubi, dove viene creato il vuoto, delle capsule ad alta velocità con binari a levitazione magnetica.   Credits: Virgin Hyperloop on instagram.com/p/CRHEB9ctQ6u/   Qualche tempo fa, mi è capitato di leggere un interessante articolo su come la progettazione della soluzione guidata dal gruppo Virgin, sia stata affiancata da analisi svolte mediante un sistema di ottimizzazione matematica. Come meglio descritto nel seguito, un digital twin, completamente basato su un modello matematico di ottimizzazione, permette di valutare le migliori scelte progettuali tenendo in considerazione i vari obiettivi di progetto.   La necessità di avere un digital twin nasce probabilmente dal fatto che le tecnologie  hyperloop  non hanno una base di partenza già esistente. No...

Dispense di ricerca operativa

Vi sottopongo alla vostra attenzione le dispense del corso di ricerca operativa, a cura della professoressa Laura Palagi . Scorrendo l'indice si possono molti argomenti interessanti, sia teorici che pratici. Questa dispensa conta ben 229 pagine, per cui è molto più vicino ad un buon manuale che a delle semplici dispense di un corso universitario. Ricerca Operativa PDF

Teoria dell'incertezza

Dal sito internet del Prof. Baoding Liu ho trovato due interessanti libri sulla teoria dell'incertezza. Uncertainty Theory Uncertainty theory is a branch of mathematics based on normality, monotonicity, self-duality, and countable subadditivity axioms. The goal of uncertainty theory is to study the behavior of uncertain phenomena such as fuzziness and randomness. The main topics include uncertainty theory, probability theory, credibility theory, and chance theory. This book provides a self-contained, comprehensive and up-to-date presentation of uncertainty theory. The purpose is to equip the readers with an axiomatic approach to deal with uncertainty. Theory and Practice of Uncertain Programming Real-life decisions are usually made in the state of uncertainty (fuzziness and randomness). How do we model optimization problems in uncertain environments? How do we solve these models? In order to answer these questions, this book provides a self-contained, comprehensive and up-to-date ...