About us
ACDA27 brings together researchers who design and study combinatorial and graph algorithms motivated by applications. It 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. ACDA27 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.
Important Dates
Tue, Sep 15, 2026
Paper submission deadline (estimated mid-September)Call For Paper
Algorithms
Combinatorial optimization
Discrete math
A more detailed call for papers will be published in Spring 2026.
Committee
Program Committee Chairs
Gonzalo Navarro
PC co-chair
Yihan Sun
PC co-chair
Organizing Committee Chairs
Paul Hovland
OC co-chair
Henning Meyerhenke
OC co-chair

