This is the conference of the SIAM Activity Group on Applied & Computational Discrete Algorithms.

ACDA25 brings together researchers who design and study combinatorial and graph algorithms motivated by applications. ACDA25 is organized by SIAM under the auspices of its Activity Group on Applied and Computational Discrete Algorithms. ACDA25 includes in its scope all topics where models and algorithms from discrete mathematics are applied to solve problems in computer science, scientific computing, data science, physical sciences, life sciences, engineering, social and information sciences, etc. ACDA25 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 ACDA25 conference will include refereed proceedings as well as talks without proceedings papers (in the conventional SIAM style of conferences), posters, tutorials, invited talks, and industry sessions. Awards will be given for best paper, best poster, and best student presentation