Friday, June 10, 2011

[DMANET] ISAAC 2011 Final CFP

Final call for papers

******************************************************************
** REMINDER: The page limit for ISAAC 2011 submissions is 10. **
******************************************************************


The 22nd International Symposium on Algorithms and Computation

ISAAC 2011

Yokohama, Japan
December 5-8, 2011.
http://www.is.titech.ac.jp/isaac11/


The 22nd International Symposium on Algorithms and Computation (ISAAC
2011) will be held in Yokohama, Japan, December 5-8, 2011. The
symposium is intended to provide a forum for researchers working in
algorithms and theory of computation. Papers presenting original
research in the areas of algorithms and theory of computation are
sought. Papers in relevant applied areas are also welcome.

Topics
The topics include, but are not limited to:
* Algorithmic game theory
* Algorithms and data structures
* Approximation algorithms
* Combinatorial optimization
* Computational biology
* Computational complexity
* Computational geometry
* Cryptography
* Experimental algorithms
* Graph drawing and graph algorithms
* Internet algorithms
* Online algorithms
* Parallel and distributed algorithms
* Quantum computing
* Randomized algorithms

Important Dates
* Submission deadline: June 24, 2011
* Notification of acceptance: August 22, 2011
* Final version due: September 16, 2011

Invited Speakers
Sanjeev Arora (Princeton University, USA)
Dorothea Wagner (Karlsruhe Institute of Technology, Germany)

Invited Speakers for the CompView GCOE Symposium:
(held at the same site on December 5, 2011)
Kazuo Iwano (Vice President, IBM Japan, Japan)
Ravi Kannan (Microsoft Research Labs., India)

Publication
The symposium proceedings will be published by Springer-Verlag in the
Lecture Notes in Computer Science (LNCS) series. Selected papers will
be invited to special issues of Algorithmica and International
Journal of Computational Geometry and Applications.

Paper Submission
Submissions should contain a scholarly exposition of ideas,
techniques, and results, including motivation and a clear comparison
with related work. Sub-missions including title, abstract, and
references, must be typeset using LNCS style; they must not exceed 10
pages. An optional appendix should be used to provide proof details
that do not fit in the main text. Submitted papers must describe work
not previously published. They must not be submitted simultaneously
to another conference with refereed proceedings or to a journal.
Drafts which contain essentially the same results as papers under
review in other conferences or journals at the moment of submission
cannot be submitted to ISAAC 2011. Only electronic submission (pdf)
will be allowed via the easychair submission server
(http://www.easychair.org/conferences/?conf=isaac2011).

Awards
A Best Paper and a Best Student Paper will be awarded. A paper is
eligible for the Best Student Paper Award if all authors are
full-time students at the time of submission. To indicate that a
submission is eligible, please add the phrase "Eligible for the Best
Student Paper Award" as the last sentence in the "Abstract" field in
the Web form of the submission server as well as in the paper.

Contact
isaac11@is.titech.ac.jp

**********************************************************
*
* 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/
*
**********************************************************