The SIAM Conference on Applied and Computational Discrete Algorithms is a new conference that brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA is organized by SIAM under the auspices of the SIAM Activity Group on Applied and Computational Discrete Algorithms. ACDA subsumes the long-running series of SIAM Workshops on Combinatorial Scientific Computing, and expands its scope to applications of discrete models and algorithms across all areas in the physical and life sciences and engineering, the social and information sciences, and anywhere discrete mathematical techniques are used to formulate and solve problems in the world. ACDA invites papers on the formulation of combinatorial problems from applications; theoretical analyses; design of algorithms; computational evaluation of the algorithms; and deployment of the resulting software to enable applications.

The conference will include a refereed proceedings and additional submitted talks that are not part of the proceedings. It will also include invited talks, an industrial problem session, a poster session, and one or two minitutorials to introduce general topical areas in applied combinatorics. Awards will be given for best paper, best poster, and best student presentation.

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) will be held in hybrid or virtual format. Please see the FAQ on COVID-19 Contingency Plans for additional information.