Scope
The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Submissions should present significant contributions supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-)heuristics, or application-driven case studies that deepen the understanding of a problem’s complexity.
Contributions solicited cover a variety of topics including but not limited to:
* Algorithm Engineering
* Analysis of Algorithms
* Approximation Techniques
* Bioinformatics
* Combinatorial Structures and Graphs
* Communication Networks
* Computational Geometry
* Computational Learning Theory
* Computational Optimization
* Cryptography and Security
* Data Structures
* Distributed and Parallel Algorithms
* Experimental Techniques and Statistics
* Graph Drawing
* Information Retrieval
* Logistics and Operations Management
* Machine Learning and Data Mining
* Mathematical Programming
* Metaheuristic Methodologies
* Multiple Criteria Decision Making
* Network Analysis
* On-line Problems
* Randomized Techniques
* Robotics
* Software Repositories and Platforms
IMPORTANT DATES
Submission deadline: January 19, 2009 (11:59 pm PST)
Author notification: March 6, 2009
Camera ready due: March 20, 2009
Symposium: June 3–6, 2009
This CfP was obtained from WikiCFP
