We solicit high-quality proceedings papers and poster 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 & Geometry
    Computational Biology
    Probabilistic & Randomised Algorithms
    Algorithms for Big Data Analytics
    New Paradigms of Computation

Authors are invited to submit proceedings paper or poster paper.

Proceedings paper cannot exceed 12 single-spaced pages, which includes 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. 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.

Poster paper cannot exceed 2 single-spaced pages, which includes references, figures, title, authors, affiliations, e-mail addresses, and a short (one paragraph) abstract.

All submissions have to be made via the EasyChair submission page for the conference at https://easychair.org/conferences/?conf=iwoca2018

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.

Proceedings will be published in Springer Lecture Notes in Computer Science (LNCS) and made available at the Workshop. 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).