The 31st International Computing and Combinatorics Conference (COCOON 2025) will be held in Chengdu, China during 15-17 August, 2025. 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 also 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.

Topics of interest

The topics of interest include (but are not limited to) the following:

Algorithms and Data Structures
Algorithmic Game Theory and Mechanism Design
Approximation Algorithms 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
Exact and Parameterized Algorithms
Graph Drawing and Information Visualization
Graph Theory, Communication Networks, and Optimization
Parallel and Distributed Computing