ISAAC: International Symposium on Algorithms and Computation

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2022 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
ISAAC 2021 International Symposium on Algorithms and Computation
Dec 6, 2021 - Dec 6, 2021 Fukuoka, Japan Jul 5, 2021
ISAAC 2020 International Symposium on Algorithms and Computation
Dec 14, 2020 - Dec 18, 2020 Online Jun 29, 2020
ISAAC 2019 International Symposium on Algorithms and Computation
Dec 8, 2019 - Dec 11, 2019 Shanghai, China Jun 30, 2019
ISAAC 2018 The 29th International Symposium on Algorithms and Computation
Dec 16, 2018 - Dec 19, 2018 Jiaoxi, Yilan County, Taiwan Jun 29, 2018
ISAAC 2017 International Symposium on Algorithms and Computation
Dec 9, 2017 - Dec 12, 2017 Phuket, Thailand Jun 29, 2017
ISAAC 2016 International Symposium on Algorithms and Computation
Dec 12, 2016 - Dec 14, 2016 Sydney, Australia Jun 24, 2016
ISAAC 2014 International Symposium on Algorithms and Computation
Dec 15, 2014 - Dec 17, 2014 Jeonju, Korea Jun 16, 2014
ISAAC 2013 International Symposium on Algorithms and Computation
Dec 16, 2013 - Dec 18, 2013 Hong Kong Jun 15, 2013
ISAAC 2012 The 23rd International Symposium on Algorithms and Computation
Dec 19, 2012 - Dec 21, 2012 Taipei, Taiwan Jun 22, 2012
ISAAC 2010 The 21st International Symposium on Algorithms and Computation
Dec 15, 2010 - Dec 17, 2010 Jeju Island, Korea Jun 18, 2010
ISAAC 2009 20th Int'l Symposium on Algorithms and Computation
Dec 16, 2009 - Dec 18, 2009 Hawaii, USA Jul 12, 2009
 
 

Present CFP : 2021

Call for Papers

Topics

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 2021. 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) is 12 pages, with references and the optional appendix excluded. Use the LIPIcs style file as given; for instance, do not change the margin size or the font, or make a separate title page, or create new latex environments.

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 July 5, 2021 (Anywhere on Earth). Only electronic submission will be allowed via the easychair submission server http://www.easychair.org/conferences/?conf=isaac2021.

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

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.

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.

Journal Special Issues

We plan to publish full versions of selected papers in Algorithmica and Computational Geometry: Theory and Applications (CGTA). Authors of selected papers will be invited to submit their manuscripts after the symposium.
 

Related Resources

COCOON 2021   Computing and Combinatorics Conference
RP 2021   15th International Conference on Reachability Problems (RP'21)
CST 2021   8th International Conference on Foundations of Computer Science & Technology
SYNASC 2021   23th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
EI Compendex, Scopus-AI2A 2021   2021 International Conference on Artificial Intelligence, Automation and Algorithms (AI2A 2021)
CAIJ 2021   Computer Applications: An International Journal
ICMLA 2021   20th IEEE International Conference on Machine Learning and Applications
CSEA 2021   7th International Conference on Computer Science, Engineering and Applications
ICONIP 2021   The 28th International Conference on Neural Information Processing (ICONIP2021)
SODA 2022   Symposium on Discrete Algorithms