COCOON 2012 - The 18th International Computing and Combinatorics Conference (COCOON'2012)

Website cocoon.it.usyd.edu.au | Edit Freely

Category COCOON 2012

Deadline: February 18, 2012 | Date: August 20, 2012-August 22, 2012

Venue/Country: Sydney, Australia

Updated: 2011-11-23 13:34:01 (GMT+9)

Call For Papers - CFP

Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing 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. Typical, but not exclusive, topics of interest include:

Algorithms and Data Structures

Algorithmic Game Theory and Online Algorithms

Automata, Languages, Logic, and Computability

Combinatorics Related to Algorithms and Complexity

Complexity Theory

Computational Learning Theory and Knowledge Discovery

Cryptography, Reliability and Security, and Database Theory

Computational Biology and Bioinformatics

Computational Algebra, Geometry, and Number Theory

Graph Drawing and Information Visualization

Graph Theory, Communication Networks, and Optimization

Parallel and Distributed Computing

The conference proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science series. High quality papers will be invited to a special issue in Algorithmica.