Lars A. Arge large at
Mon Jul 7 12:53:21 PDT 2003

			      Call For Papers

	   6th Workshop on Algorithm Engineering and Experiments
				 ALENEX 04

		January 10, 2004, Astor Crown Plaza Hotel,
			  New Orleans, Louisiana

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.

The workshop is supported by SIAM, the Society for Industrial and Applied
Mathematics; and SIGACT, the ACM Special Interest Group on Algorithms and
Computation Theory.

Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT,
SEPTEMBER 19, 2003 (strict deadline) and must use the SIGACT electronic
submissions server. Detailed instructions for submitting to the workshop
can be found at

Notification of acceptance or rejection will be sent by the end of November
2003. The deadline for receipt of papers in final version is January 5,
2004. Presenters must have submitted the final versions of their papers in
order to be able to present them at the workshop.

Program Committee:
Lars Arge, Duke University (co-chair)
Jon Bentley, Avaya Labs Research
Mark de Berg, TU Eindhoven
Monika Henzinger, Google Inc
Giuseppe F. Italiano, University of Rome (co-chair)
David Karger, MIT
Ulrich Meyer, Max-Planck-Institut fur Informatik
Jan Vahrenhold, University of  Munster

Important dates:
Submission of Papers     September 19, 2003
Notification of Accept   End of November, 2003
Final Version due        January 5, 2004

For more information:
--------------------- or email
large at or italiano at

The compgeom mailing lists: see
or send mail to compgeom-request at with the line:
send readme
Now archived at

More information about the Compgeom-announce mailing list