COCOON 2012 - The 18th International Computing and Combinatorics Conference (COCOON'2012)
Topics/Call fo Papers
The 18th International Computing and Combinatorics Conference (COCOON'2012) will be held in the city of Sydney, Australia, in August 20--22, 2012.
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.
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.
Other CFPs
Last modified: 2011-11-23 13:34:01