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 2026. ALENEX is supported by
SIAM.
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 conferences 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)
Important Dates
Full Paper Submission: July 18, 2025
Author Notification: August 30, 2025
AE submission (for accepted papers): September 6, 2025
AE author notification: October 8, 2025
Camera ready submission: October 15, 2025
Program Committee Chairs
Simon J. Puglisi (University of Helsinki)
Nate Veldt (Texas A&M University)
Program Committee
Aydin Buluc (Lawrence Berkeley National Laboratory, U.S.)
Sarah Cannon (Claremont McKenna College, U.S.)
Laxman Dhulipala (University of Maryland, U.S.)
Jonas Ellert (ENS Paris, France)
S M Ferdous (Pacific Northwest National Laboratory, U.S.)
Assefaw Gebremedhin (Washington State University, U.S.)
Yan Gu (UC Riverside, U.S.)
Inge Li Gørtz (Technical University of Denmark, Denmark)
Christian Komusiewicz (University of Jena, Germany)
Quanquan C. Liu (Princeton University, U.S.)
Joel Mackenzie (University of Queensland, Australia)
Prashant Pandey (Northeastern University, U.S.)
Frank Sommer (TU Wien, Austria)
Sabine Storandt (University of Konstanz, Germany)
David Tench (Lawrence Berkeley National Laboratory, U.S.)
Helen Xu (Georgia Institute of Technology, U.S.)
Steering Committee Chair
Martin Farach-Colton, New York University, U.S.
Steering Committee
Kathrin Hanauer (University of Vienna, Austria)
Solon Pissis (CWI, Netherlands)
Julian Shun (Massachusetts Institute of Technology, U.S.)
Paolo Ferragina (University of Pisa, Italy)
Alex Pothen (Purdue University, U.S.)
Helen Xu (Georgia Institute of Technology, U.S.)
The EasyChair submission site is available:
https://easychair.org/my/conference?conf=alenex26
For questions, please contact ALENEX'26 co-chairs, Simon Puglisi
(simon.puglisi@ helsinki.fi) and Nate Veldt (nveldt@tamu.edu).
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************