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. 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
Graph theory
Network optimization problems
Operation research
Optimal resource management
Scheduling

Paper Submission:

The submission should contain a scholarly exposition of ideas, techniques, and results, including motivation and a clear comparison with related work. The length of the submission should not exceed 12 pages in LNCS style. Submitted papers must describe work not previously published. They must not be submitted simultaneously to another conference with refereed proceedings or to a journal. We regard the following case as a simultaneous submission. Submission of drafts which contain the essentially same results from papers under review in other conferences or journals at the moment of the submission. Only electronic submission (pdf) will be allowed via the EasyChair electronic submission system at http://www.easychair.org/conferences/?conf=cocoa2013.

Publication:

The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series. After the conference, some selected papers will be published in special issues of Theoretical Computer Science and Journal of Combinatorial Optimization.

Important Dates:

Submission due: August 2, 2013 (Friday, by 11:59:59 PM, your local time)
Notification of acceptance: September 16, 2013
Final version due: September 27, 2013
Early (accepted paper) registration due: October 18, 2013