*Topics*
Authors are invited to submit papers presenting original and unpublished
research on algorithms and complexity. Typical areas include:
-algorithm design and analysis
-sequential, parallel, and distributed algorithms
-data structures
-computational and structural complexity
-lower bounds and limitations of algorithms
-randomized and approximation algorithms
-parameterized algorithms and parameterized complexity classes
-smoothed analysis of algorithms
-alternatives to the worst-case analysis of algorithms (e.g., algorithms
with predictions)
-on-line computation and competitive analysis
-streaming algorithms
-quantum algorithms and complexity
-algorithms in algebra, geometry, number theory and combinatorics
-computational geometry
-algorithmic game theory and mechanism design
-algorithmic economics (including auctions and contests)
-computational learning theory
-computational biology and bioinformatics
-algorithmic issues in communication networks
-algorithms for discrete optimization (including convex optimization)
-algorithm engineering
*Paper Submission and Proceedings*
Authors are invited to submit an extended abstract or full paper with at
most 15 pages, excluding the title page and the references. The title page
consists of the title of the paper and the abstract. The first section of
the paper should start on the next page.