Call for Papers
Original research papers in the areas of combinatorial optimization
and its applications are solicited. In addition to theoretical results, we
are particularly interested in submissions that report on experimental and
applied research of general algorithmic interest. Special consideration
will be given to research that is motivated by real-world problems.
Experimental and applied papers are expected to show convincingly the
usefulness and efficiency of the algorithms discussed in a practical
setting.
The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series.
After the conference, some selected papers will be published in
special issues of the Journal of Combinatorial Optimization, Theoretical Computer Science, Discrete Mathematics, Algorithms and Applications.
Typical, but not exclusive, topics of interest include:
- Algorithms and Data Structures
- Approximation Algorithms
- Bioinformatics
- Communication Networks
- Computational Algebra
- Computational Biology
- Computational Financing
- Computational Game Theory
- Computational Geometry
- Computational Learning Theory
- Computational Number Theory
- Extremal Graph Theory
- Graph Searching
- Graph Theory
- Network Flow
- Network Optimization Problems
- Operation Research
- Optimal Resource Management
- Parallel and Distributed Computing
- Scheduling
Important Dates:
- Submission Due: February 28, 2009 (extended)
- Notification of Acceptance: March 15, 2009
- Final Version Due: April 1, 2009
