The meeting is being held with:
Analytic Algorithmics and Combinatorics (ANALCO15)
January 4, 2015
ACM-SIAM Symposium on Discrete Algorithms (SODA15)
January 4-6, 2015



To RSVP to the conference on Facebook and connect with other attendees, find roommates etc., please visit

If you are tweeting about the conference, please use the designated hashtag to enable other attendees to keep up with the Twitter conversation and to allow better archiving of our conference discussions.  The hashtag for ALENEX is #ALENEX15, and ANALCO is #ANALCO15.

Program Committee Chair

Andrew V. Goldberg, Microsoft Research, USA

Program Committee

Umut Acar, Carnegie Mellon University, USA, and INRIA, France
Aaron Archer, Google Research, USA
Lars Arge, Aarhus University, Denmark
Ulrik Brandes, University of Konstanz, Germany
Camil Demetrescu, Sapienza University of Rome, Italy
David Eppstein, University of California, Irvine, USA
Loukas Georgiadis, University of Ioannina, Greece
Haim Kaplan, Tel Aviv University, Israel
Bernard Moret, École Polytechnique Fédérale de Lausanne, Switzerland
Ian Munro, University of Waterloo, Canada
Petra Mutzel, Technische Universität Dortmund, Germany
Roberto Tamassia, Brown University, USA
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
David P. Williamson, Cornell University, USA

Steering Committee

David Applegate, AT&T Labs, USA
Lars Arge, Aarhus University, Denmark
David Bader, Georgia Institute of Technology, USA
Guy Blelloch, Carnegie Mellon University, USA
Gerth Stølting Brodal, Aarhus University, Denmark
Irene Finocchi, Sapienza University of Rome, Italy
Mike Goodrich (chair), University of California, Irvine, USA
John Hershberger, Mentor Graphics, USA 
David Johnson, Columbia University, USA
Bernard Moret, École Polytechnique Fédérale de Lausanne, France 
Petra Mutzel , Technische Universität Dortmund, Germany
Matthias Müller-Hannemann, Martin-Luther-Universität, Halle-Wittenberg, Germany 
Rajeev Raman, University of Leicester, United Kingdom
Cliff Stein, Columbia University, USA 
Dorothea Wagner, Karlsruhe Institute of Technology, Germany
Renato Werneck, Microsoft Research, USA



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. Some possible areas of applied algorithmic research include but are not limited to databases; networks, including web applications; operations research; and computational problems in the natural sciences or engineering. Submissions are encouraged that address algorithms and data structures for advanced models of computing including memory hierarchies and parallel computing, ranging from instruction parallelism over multicore computing to exascale and cloud computing.

ALENEX is co-located with the ACM-SIAM Symposium on Discrete Algorithms (SODA15), and Analytic Algorithmics and Combinatorics (ANALCO15). 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.

Proceedings of ALENEX and ANALCO will be published openly and electronically in December 2014. A special section of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX15.

A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. We recognize, however, that some research projects spawn multiple papers that elaborate on different aspects of the work, and are willing to respond to inquiries about SODA, ALENEX, and ANALCO papers that may overlap. Questions regarding ALENEX may be sent to ALENEX chair Andrew Goldberg (

ALENEX is supported by SIAM (Society for Industrial and Applied Mathematics) and SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).


Funding Agencies

Funding agency information will be posted here when available.


Important Deadlines

September 22, 2014, 11:59 PM EDT
Acceptance/rejection notices will be sent to authors via email in late October 2014

December 1, 2014 Disconnect time is 4:00 PM EST

December 1, 2014

Renew SIAM · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube