| |||||||||||||||
ISAAC 2017 : International Symposium on Algorithms and ComputationConference Series : International Symposium on Algorithms and Computation | |||||||||||||||
Link: http://aiat.in.th/isaac2017/ | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
The 28th International Symposium on Algorithms and Computation (ISAAC 2017) will be held in Phuket, Thailand on December 9-12, 2017. 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 welcomed. 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. Submission Guidelines Authors are invited to submit an extended abstract or full paper of at most 12 pages with an optional appendix. The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison with related work. 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 cannot be submitted to ISAAC 2017. Exempted are workshops and conferences without formal proceedings, but possibly with handouts containing short abstracts. At least one author of an accepted paper is required to present the paper at the conference as a registered participant. Papers must be formatted in \LaTeX, using the LIPIcs style file, which is available at http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/. The maximum length of the paper (including title, the list of authors, abstract, references, but excluding the optional appendix) is 12 pages. Do not change the margin size or the font, do not make a separate title page, etc.: use the LIPIcs style file as given. Proofs omitted due to space constraints must be placed in an appendix that is to be read by the program committee members at their discretion and will not be published as part of the proceedings. Thus the paper without the appendix should be able to stand on its own. Submissions are due on June 29, 2017 11:59PM (PDT). Only electronic submission will be allowed via the easychair submission server http://www.easychair.org/conferences/?conf=isaac2017. These guidelines are strict: papers failing to adhere to the guidelines (by not providing the omitted proofs in an appendix, being more than 12 pages, or not being in LIPIcs format) will be rejected without consideration of their merits. Availability of Full Versions Polished full versions are expected to be published in refereed journals after the ISAAC conference. Upon acceptance, if there is an omitted detail in the camera-ready version for ISAAC, authors are encouraged to upload a full version of the accepted paper to a preprint server, e.g., arXiv, ECCC, or an e-repository at universities/institutes, so that interested readers can access the full proofs that are omitted in ISAAC proceedings. When authors refer to omitted proofs in ISAAC proceedings, citation to the accessible full version is desired. However, uploading a full version is not mandatory for authors. Special Issues Special issues in Algorithmica and International Journal of Computational Geometry and Applications are planned for selected papers from ISAAC 2017. Awards The Best Paper and the Best Student Paper will be awarded. A paper is eligible for the Best Student Paper if all authors are full-time students at the time of submission. To indicate that a submission is eligible, please mark the checkbox "Eligible for best student paper" in the web form on the submission server. |
|