This book investigates the intersection of theoretical computer science and combinatorics, focusing on algorithms and their complexity. It presents research findings from the 2007 International Conference on Computing and Combinatorics (COCOON). The collection explores various algorithmic problems and their combinatorial underpinnings, offering insights into efficient problem-solving techniques.

This volume is a collection of peer-reviewed papers presented at the COCOON 2007 conference, indicating a focus on academic and research-level content. The subject matter suggests a dense, technical text aimed at computer scientists, mathematicians, and researchers specializing in algorithms and discrete mathematics. Its value lies in presenting current advancements and theoretical explorations within its specific subfields.