Conference on Combinatorial Optimization and Applications

The Conference on Combinatorial Optimization and Applications (COCOA) is an internationally recognized venue for researchers working at the intersection of discrete mathematics, operations research, and algorithm design. The conference brings together theoreticians and practitioners to present advances in combinatorial algorithms, network optimization, scheduling, graph theory, and their real-world applications. COCOA fosters a collaborative environment where mathematical rigor meets practical problem-solving, spanning application domains from logistics and telecommunications to bioinformatics and social network analysis.

theory algorithms complexity combinatorics

Authors are invited to submit original research papers on topics including combinatorial optimization, approximation algorithms, graph algorithms, integer programming, network design, scheduling theory, and computational aspects of operations research. Papers addressing novel applications of combinatorial methods to real-world problems are also encouraged. Submissions must represent original work not under review elsewhere.