[DMANET] ALENEX 2013 - Call for Papers

**********************************************************************

ALENEX 2013 - MEETING ON ALGORITHM ENGINEERING & EXPERIMENTS

January 7, 2013
Astor Crowne Plaza Hotel
New Orleans, Lousiana, USA
http://www.siam.org/meetings/alenex13

**********************************************************************

- SCOPE -

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 (SODA13), and Analytic Algorithmics and Combinatorics
(ANALCO13). 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 2012. A special issue of the ACM Journal of
Experimental Algorithmics will be dedicated to selected papers from
ALENEX13.

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. regarding
ALENEX may be sent to ALENEX co-chairs Peter Sanders (sanders@kit.edu)
or Norbert Zeh (nzeh@cs.dal.ca).

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

- SPECIAL NOTICE OF CHANGES FOR 2013 -

ALENEX will be offered as a fourth "track" on the second day of SODA
(January 7, 2013). The ANALCO and ALENEX programs will be integrated
with the SODA program and all papers will be available online before
the conference. The integration of ALENEX into the SODA programme
leads to a tight time line after acceptance of papers. Thus, there
are two deadlines for accepted papers: one for submission of final
title and abstract of the paper for inclusion in the programme booklet
and one for submission of the final version of the paper to be included
in the electronic proceedings.

- IMPORTANT DATES -

Submission: September 25, 2012 (11:59 EDT)
Notification of authors: October 22, 2012
Final version of title and abstracts: October 29, 2012
Camera-ready paper: November 13, 2012

- SUBMISSIONS -

Authors are invited to submit a 10-page extended abstract. Authors may
include a clearly marked appendix, which will be read at the discretion
of the programme commitee.

Papers should begin with the title of the paper, each author's name,
affiliation, and e-mail address, followed by a clear statement of the
problem considered, a succinct summary of the results obtained, a
brief discussion of the significance and novelty of the research, and
a clear comparison with related work. The remainder of the extended
abstract should provide sufficient detail to allow the program
committee to evaluate the validity, quality, and relevance of the
contribution.

Submissions should be typeset in single column format, using 11-point
or larger font, with reasonable margins and line spacing. Excluding
the title page and bibliography, the extended abstract must not exceed
ten pages. Supplementary material may be included in the appendix and
will be read at the discretion of the reviewers.

Authors of accepted papers are strongly encouraged to submit publicly
available code and data to the ACM Journal of Experimental
Algorithmics Research Code Repository via
http://www.jea.acm.org/repository/.


- PROGRAMME COMMITTEE -

Graham Cormode, AT&T Labs Research, USA
Daniel Delling, Microsoft Research, USA
Rolf Fagerberg, University of Southern Denmark, Denmark
Irene Finocchi, University of Rome "La Sapienza," Italy
Bruce Hendrickson, Sandia National Laboratories, USA
Alejandro López-Ortiz, University of Waterloo, Canada
Gonzalo Navarro, University of Chile, Chile
Knut Reinert, Freie Universität Berlin, Germany
Peter Sanders, Karlsruhe Institute of Technology, Germany (co-chair)
Martin Skutella, Technische Universität Berlin, Germany
Kavitha Telikepalli, Tata Institute of Fundamental Research, India
Takeaki Uno, National Institute of Informatics, Japan
Ke Yi, Hong Kong University of Science and Technology, Hong Kong
Norbert Zeh, Dalhousie University, Canada (co-chair)
**********************************************************
*
* 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/
*
**********************************************************