Workshop Co-chairs

Matthias Müller-Hannemann, Martin-Luther-Universität Halle-Wittenberg, Germany
Renato Werneck, Microsoft Research Silicon Valley, USA

Program Committee

Glencora Borradaile, Oregon State University, USA
Rezaul Chowdhury, University of Texas at Austin, USA
Camil Demetrescu, University of Rome “La Sapienza”, Italy
Marco E. Lübbecke, RWTH Aachen University, Germany
Rolf H. Möhring, Technische Universität Berlin, Germany
Bernard Moret, Ecole Polytechnique Fédérale de Lausanne, Switzerland
David Mount, University of Maryland, USA
Kunihiko Sadakane, National Institute of Informatics, Japan
Roberto Tamassia, Brown University, USA
Laura Toma, Bowdoin College, USA
Anthony Wirth, University of Melbourne, Australia
Ke Yi, Hong Kong University of Science and Technology, Hong Kong
Christos Zaroliagis, University of Patras, Greece


The Workshop on Algorithm Engineering and Experiments (ALENEX11) will be held on January 22, 2011 at the Holiday Inn San Francisco Golden Gateway, San Francisco, California, USA.

The aim of the ALENEX workshop is to provide a forum for presentation of original research in the implementation and experimental evaluation of algorithms and data structures. We invite submissions that present significant case studies in experimental analysis (such studies may tighten, extend, or otherwise improve current theoretical results) or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios, including specific applied areas (for example, databases, networks, operations research, computational biology and physics, computational geometry, and the world wide web) that present unique challenges in their underlying algorithmic problems. We also invite submissions that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include time for discussion and debate of topics in this rapidly evolving research area.
This workshop precedes the ACM-SIAM Symposium on Discrete Algorithms (SODA11) being held January 23-25, 2011.  The workshop will take place on the same day as the Analytic Algorithmics and Combinatorics (ANALCO11). Since researchers in both fields are approaching the problem of learning detailed information about the performance of particular algorithms, we expect that interesting synergies will develop.

Registrants from either workshop will be cross-registered with the other. Proceedings of ALENEX and ANALCO will be published openly and electronically in January 2011. A special issue of the ACM Journal of Experimental Algorithmics will be dedicated to selected papers from ALENEX10.

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. Papers of interest to both the ALENEX and the ANALCO communities are particularly encouraged. Such papers may be submitted to either workshop and will, as appropriate, be presented in a joint session. Inquiries regarding ALENEX may be sent to workshop organizers Matthias Müller-Hannemann (muellerh<at> or Renato Werneck (renatow<at>

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

Important Deadlines

Tuesday, October 5, 2010

December 20, 2010

December 20, 2010

Donate · Contact Us · Site Map · Join SIAM · My Account
Facebook Twitter Youtube linkedin google+