Papers are solicited in all research areas related to randomization and approximation, including, but not limited to: 

APPROX

• approximation algorithms

• hardness of approximation

• small space, sub-linear time and streaming algorithms

• online algorithms

• approaches that go beyond worst case analysis

• distributed and parallel approximation​

• embeddings and metric space methods

• mathematical programming methods

• spectral methods

• combinatorial optimization in graphs and networks

• algorithmic game theory, mechanism design and economics

• computational geometric problems

• approximate learning

RANDOM

• design and analysis of randomized algorithms

• randomized complexity theory

• pseudorandomness and derandomization

• random combinatorial structures

• random walks/Markov chains

• expander graphs and randomness extractors

• probabilistic proof systems

• random projections and embeddings

• error-correcting codes

• average-case analysis

• property testing

• computational learning theory