The series of IWOCA conferences grew out of over 25 years history of the International (since 2007) respectively Australasian (until 2006) Workshops on Combinatorial Algorithms. Previous IWOCA and AWOCA meetings have been held in Australia, Canada, Czech Republic, Finland, France, Indonesia, India, Italy, Japan, South Korea, UK, and the US. Previous IWOCAs can be found at http://www.iwoca.org/

We solicit high-quality papers in the broad area of combinatorial algorithms. The topics include (but are not restricted to):

• Complexity Theory
• Graph Theory & Combinatorics
• Combinatorial Optimization
• Cryptography & Information Security
• Algorithms on Strings & Graphs
• Graph Drawing & Labelling
• Computational Algebra &p Geometry
• Computational Biology
• Probabilistic & Randomised Algorithms
• Algorithms for Big Data Analytics
• New Paradigms of Computation

• Martin Baca (Technical University, Kosice)
• Diane Donovan (University of Queensland)
• Henning Fernau (University of Trier)
• Costas Iliopoulos (King’s College London) will give a joint talk with his PhD student Mai Alzamel.
• Jennifer Seberry (University of Wollongong)

European Association for Theoretical Computer Science (EATCS) will award a prize to the author(s) of the best student paper. To be eligible for this award, all the authors of the paper have to be students at the time of submission. Authors who wish their paper to be considered for the Best Student Paper Award should inform the chairs of their eligibility via email by the paper submission deadline.

In IWOCA tradition, we will hold an open problems session at IWOCA2017. If you have an open problem that would like to share with other conference participants or wider IWOCA community, please email to the open problems chair Gabriele Fici (gabriele.fici@unipa.it).

Proceedings will be published in Springer Lecture Notes in Computer Science (LNCS) after the conference. Authors of selected papers will be invited to submit extended versions of their papers to a special issue of the Journal of Discrete Algorithms (JDA).

A PDF version of this Call for Papers can be downloaded here.

Authors are invited to submit a paper not exceeding 12 single-spaced pages, including references, figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract. The authors are strongly advised to use the LaTeX style file supplied by Springer Verlag for Lecture Notes in Computer Science here. Final proceedings papers must be camera-ready in this format. A clearly marked Appendix, which will not count toward the 12 page submission limit, can be included and will be read at the referees’ discretion. All submissions have to be made via the EasyChair submission page for the conference at https://easychair.org/conferences/?conf=iwoca2017

Papers submitted for review should represent original, previously unpublished work and surveys of important results. At the time the paper is submitted to IWOCA, and for the entire review period, the paper (or essentially the same paper) should not be under review by any other conference with published proceedings or by a scientific journal. At least one author of each accepted paper will be expected to attend the conference and present the paper.

A PDF version of detailed Call for Papers can be downloaded here. For more details, please refer to the page of Call for Papers