menu
{ "item_title" : "Computing and Combinatorics", "item_author" : [" Fedor V. Fomin", "Mingyu Xiao "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/9/81/950/214/9819502144_b.jpg", "price_data" : { "retail_price" : "79.99", "online_price" : "79.99", "our_price" : "79.99", "club_price" : "79.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Computing and Combinatorics|Fedor V. Fomin

Computing and Combinatorics : 31st International Computing and Combinatorics Conference, Cocoon 2025, Chengdu, China, August 15-17, 2025, Proceedings,

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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 item is Non-Returnable

Details

  • ISBN-13: 9789819502141
  • ISBN-10: 9819502144
  • Publisher: Springer
  • Publish Date: August 2025
  • Dimensions: 9.21 x 6.14 x 0.8 inches
  • Shipping Weight: 1.19 pounds
  • Page Count: 361

Related Categories

You May Also Like...

    1

BAM Customer Reviews