SODA is sponsored by the SIAM Activity Group on Discrete Mathematics and the ACM Special Interest Group on Algorithms and Computation Theory.

This symposium focuses on research topics related to the design and analysis of efficient algorithms and data structures for discrete problems. The scope includes theoretical analysis, as well as experimental validation, of discrete algorithms, and the mathematical problems related to their development or limitations. The scope also includes aspects of combinatorics and discrete mathematics related to discrete algorithms. Papers that raise important algorithmic problems that can benefit from theoretical investigation and analysis, are encouraged.

SODA will be held jointly with:
SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)
SIAM Symposium on Simplicity in Algorithms (SOSA)

Included Themes

• Aspects of combinatorics and discrete mathematics
• Core topics in discrete algorithms
• Algorithmic aspects of other areas of computer science