The aim of the annual ALENEX workshops 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 (including
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 an invited talk, contributed research
papers, and time for discussion and debate of topics in this rapidly
evolving research area. The workshop is co-located with SODA 04, the 15th
ACM-SIAM Symposium on Discrete Algorithms, and will take place on the day
preceding the conference. The workshop is also co-located with the 1st
Workshop on Analytic Algorithmics and Combinatorics (ANALCO 04) and will
take place on the same day as that conference. The proceedings of ALENEX
and ANALCO will be published as a single volume. 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, ANALCO, and ALENEX papers
that may overlap.