
Give the Gift of Choice!
Too many options? Treat your friends and family to their favourite stores with a Bayshore Shopping Centre gift card, redeemable at participating retailers throughout the centre. Click below to purchase yours today!Purchase HereHome
Computing and Combinatorics: 31st International Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, Proceedings, Part I
Coles
Loading Inventory...
Computing and Combinatorics: 31st International Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, Proceedings, Part I in Ottawa, ON
Current price: $94.19
Original price: $117.71


Computing and Combinatorics: 31st International Combinatorics Conference, COCOON 2025, Chengdu, China, August 15-17, Proceedings, Part I in Ottawa, ON
Current price: $94.19
Original price: $117.71
Loading Inventory...
Size: Kobo eBook
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Coles
This two-volume set, LNCS 15983 and 15984 , constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15&17, 2025. The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:
Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.
Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.
This two-volume set, LNCS 15983 and 15984 , constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15&17, 2025. The 54 full papers were carefully reviewed and selected from 191 submissions. COCOON 2025 provided an excellent venue for researchers working in the topical sections as follows:
Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.
Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.


















