About the Conference
The ninth Workshop on Algorithm Engineering and Experiments (ALENEX07) and the fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO07) will be held immediately preceding the conference, on January 6, at the same location.
Description
This symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis.
Sponsor
Jointly sponsored by ACM Special Interest Group on Algorithms and Computation Theory and SIAM Activity Group on Discrete Mathematics.
Themes
Themes and application areas include, but are not limited to, the following topics:
Combinatorics and other aspects of Discrete Mathematics such as:
- Algebra
- Combinatorial Structures
- Discrete Optimization
- Discrete Probability
- Game Theory
- Graph Theory
- Mathematical Programming
- Number Theory
- Random Structures
- Topological Problems
other aspects of Computer Science such as:
- Combinatorial Scientific Computing
- Communication Networks
- Computational Geometry
- Computer Graphics and Computer Vision
- Computer Systems
- Data Compression
- Data Structures
- Databases and Information Retrieval
- Distributed and Parallel Computing
- Experimental Algorithmics
- Graph and Network Algorithms
- Internet Algorithmics
- Machine Learning
- On-line Problems
- Quantum Computing
- Pattern Matching
- Robotics
- Scheduling and Resource Allocation Problems
- Symbolic Computation
and applications in the Sciences and Business such as: Bioinformatics, Economics, Manufacturing and Finance
