"GA - Graph algorithms and Applications"
Satellite workshop co-located with the 38th International
Colloquium on Automata, Languages and Programming (ICALP 2011)
Sunday, July 3rd, 2011
Institute of Theoretical Computer Science, ETH Zurich, Switzerland
--------------------------------------------------------------------
GA aims to provide a forum for researchers to discuss the most
recent trends and results in graph algorithms and their
applications. One goal is to show how theoretical advances,
engineering principles and thorough experimental evaluations can help
developers build efficient, robust, and scalable applications for
domain-specific scenarios. Another goal is to extract, formalize,
and model new algorithmic graph problems from modern real-world
applications, exploring directions for future research.
The workshop is in honor of Giorgio Ausiello in the occasion of his
70th birthday.
--------------------------------------------------------------------
SCOPE
Submitted papers should consider any aspects of graph algorithms and
their applications, including but not restricted to:
Sequential, parallel, randomized, parameterized, and distributed
graph and network algorithms, I/O and cache-efficient graph
algorithms, on-line and incremental graph algorithms,
approximation algorithms for graph problems, game theoretical
concepts, graph algorithms in computational geometry, graph
algorithms in bioinformatics, graph drawing algorithms, graph
models of the Web and social networks.
We are seeking for papers presenting theoretical results and/or
computational studies. Position and survey papers as well as
papers formalizing novel interesting open problems on the workshop
topics are also welcome.
--------------------------------------------------------------------
SUBMISSION GUIDELINES
Authors are invited to submit an extended abstract or full paper of
at most 12 pages and an optional appendix. Papers must be formatted
in LaTeX. Contributions should be submitted electronically in pdf
format via the EasyChair submission system, accessible at:
http://www.easychair.org/conferences/?conf=ga20110
There will be no proceedings, but a selection of the papers accepted
for presentation at the workshop will be invited for a special issue
of Theoretical Computer Science. Indeed, because of the lack of a
proceedings, submission of work that is intended for publication
elsewhere is welcome. Such submissions should include details of
the other submission.
--------------------------------------------------------------------
IMPORTANT DATES
o Submission deadline: Saturday, April 30, 2011
o Notification: Friday, May 20, 2011
o Workshop: Sunday July 3rd, 2011 (ETH Zurich, Switzerland)
--------------------------------------------------------------------
PLENARY SPEAKERS
o Giuseppe F. Italiano, U. Rome "Tor Vergata"
o Kurt Mehlhorn, MPII, Saarbruecken
--------------------------------------------------------------------
PROGRAM COMMITTEE
o Gianfranco Bilardi. U. Padova
o Pierluigi Crescenzi, U. Firenze
o Camil Demetrescu (co-chair), Sapienza U. Rome
o Josep Diaz, UPC Barcelona
o Giuseppe Di Battista, U. Roma III
o Giorgio Gambosi, U. Rome "Tor Vergata"
o Ludek Kucera, Charles U.
o Jan van Leeuwen, Utrecht U.
o Stefano Leonardi (co-chair), Sapienza U. Rome
o Fabrizio Luccio, U. Pisa
o Alberto Marchetti-Spaccamela (co-chair), Sapienza U. Rome
o Jaroslav Nesetril, Charles U.
o Maurice Nivat, U. Paris VII
o Vangelis Paschos, U. Paris-Dauphine
o Franco Preparata, Brown U.
o Paul Spirakis, RACTI and U. Patras
o Leen Stougie, Free U. Amsterdam and CWI
o Peter Widmayer, ETH Zurich
--------------------------------------------------------------------
LOCAL ARRANGEMENTS COMMITTEE (ICALP conference chairs)
o Michael Hoffmann, ETH Zurich
o Juraj Hromkovic, ETH Zurich
o Ueli Maurer, ETH Zurich
o Angelika Steger, ETH Zurich
o Emo Welzl, ETH Zurich
o Peter Widmayer, ETH Zurich
**********************************************************
*
* 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/
*
**********************************************************
Posts
