December 14--18, 2020
The 31st International Symposium on Algorithms and Computation (ISAAC 2020) will be held online on December 14--18, 2020
due to the COVID-19 pandemic. Authors of accepted papers are expected to present their work at the symposium
(preferably by a live online talk, or at the very least by a pre-recorded talk). To allow for interactions, authors are
also encouraged to be present at the break that follows the session of their talks. The detailed online conference
format will be announced in due time.
========Important Dates========
Submission deadline: June 29, 2020 (Anywhere on Earth)
Notification: August 31, 2020
Camera-ready version: September 28, 2020
Registration: October 26, 2020
========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 2020. 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. 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 June 29, 2020 (Anywhere on Earth) . Only electronic submission will be allowed via the easychair
submission server http://www.easychair.org/conferences/?conf=isaac2020.
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.
========Program Committee========
Yixin Cao (co-chair, Hong Kong Polytechnic University)
Siu-Wing Cheng (co-chair, Hong Kong University of Science and Technology)
Minming Li (co-chair, City University of Hong Kong)
Jian-Jia Chen (University of Dortmund)
Kyle Fox (University of Texas at Dallas)
Arijit Ghosh (Indian Statistical Institute)
Nikolai Gravin (Shanghai University of Finance and Economics)
Wing-Kai Hon (National Tsinghua University)
Seok-Hee Hong (University of Sydney)
Sungjin Im (University of California at Merced)
Jesper Jansson (Hong Kong Polytechnic University)
Zhengfeng Ji (University of Technology Sydney)
Naoyuki Kamiyama (Kyushu University)
O-Joung Kwon (Incheon National University)
Lap Chi Lau (University of Waterloo)
Asaf Levin (Technion)
Daniel Lokshtanov (University of California Santa Barbara)
Yoshio Okamoto (University of Electro-Communications)
Sang-il Oum (Institute for Basic Science and KAIST)
Richard Peng (Georgia Institute of Technology)
Michał Pilipczuk (University of Warsaw)
Sheung-Hung Poon (University of Nottingham at Ningbo)
Kirk Pruhs (University of Pittsburgh)
Shang-Hua Teng (University of Southern California)
Ryuhei Uehara (Japan Advanced Institute of Science and Technology)
Kevin Verbeek (Eindhoven University of Technology)
Antoine Vigneron (Ulsan National Institute of Technology)
László Végh (London School of Economics and Political Science)
Magnus Wahlström (Royal Holloway, University of London)
Prudence Wong (University of Liverpool)
**********************************************************
*
* 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
