| |||||||||||||||
COCOA 2010 : The 4th Annual International Conference on Combinatorial Optimization and ApplicationsConference Series : Conference on Combinatorial Optimization and Applications | |||||||||||||||
Link: http://theory.utdallas.edu/COCOA2010 | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA'10) will be held during December 18-20, 2010, in The Big Island,Hawaii, USA.
Important Dates: *** (Extended) Paper Submission Deadline: July 15, 2010 (by 11:59:59 PM, CEST) *** Notification of Acceptance: August 15, 2010 *** Final Version Due: September 1, 2010 Conference website: http://theory.utdallas.edu/COCOA2010/ COCOA 2010 Publicity Committee ******************** 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. 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 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 15 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 Springer Online Conference System (OCS). 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, Journal of Combinatorial Optimization, Optimization Letters, and Discrete Mathematics, Algorithms and Applications. ========================= Organizing Committee ========================= General co-Chairs: Ding-Zhu Du (University of Texas at Dallas, USA) Panos M. Pardalos (University of Florida, USA) Bhavani Thuraisingham (University of Texas at Dallas, USA PC co-Chairs: Ovidiu Daescu (University of Texas at Dallas, USA) Weili Wu (University of Texas at Dallas, USA) |
|