The 27th International Symposium on Algorithms and Computation

December 12-14 2016, Sydney, Australia

Call for papers

The 27th International Symposium on Algorithms and Computation (ISAAC 2016) will be held in Sydney, Australia on December 12-14 2016. 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

Authors are invited to submit an extended abstract or full paper of at most 12 pages and 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 2016. At least one author of an accepted paper is required to present the paper at the conference as a registered participant.

For the first time the ISAAC 2016 proceedings will be published in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. The submission should follow the LIPIcs LaTeX style, which is available from here. The maximum length of the paper (including references, but excluding the optional appendix) is 12 pages.