SIAM Symposium on Algorithm Engineering and Experiments (ALENEX27)

About the Conference

The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures.

We welcome submissions on a broad range of topics within algorithm engineering and the experimental analysis of algorithms and data structures, including but not limited to the following:

• Combinatorial optimization and mathematical programming, including scheduling and resource allocation problems
• Computational biology and bioinformatics
• Data science and data management, including databases
• Design and analysis of application-inspired exact, approximation, randomized, streaming, and learning-augmented algorithms
• Graph and hypergraph algorithms, including problems arising in network science and complex networks
• String algorithms and data structures
• Computational geometry
• Interaction between algorithms and modern computing platforms, including challenges arising from memory hierarchies, accelerators, and novel memory technologies
• Parallel and distributed computing, including algorithms, architectures, distributed systems, and all parallelism ranging from instruction-level and multi-core all the way to clouds and Exascale computing
• Machine learning and statistical methods for solving combinatorial problems
• Other applications arising from security, computational finance, computational chemistry/physics, quantum computing, etc.

Proceedings will be posted online in January 2027. Visit the Artifact Evaluation Section for more information regarding submitting artifacts.

Since researchers in all fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop between the co-located conferences.

The following meetings will be held jointly:

• ACM-SIAM Symposium on Discrete Algorithms (SODA)
• SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)
• SIAM Symposium on Simplicity in Algorithms (SOSA)

Connect with other attendees on LinkedIn.