Name: Computing and Combinatorics. 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II
Price: 75.41 EUR
Availability: InStock
Author: Fedor V. Fomin;Mingyu Xiao
ISBN: 9789819502172

portada Computing and Combinatorics. 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II

Computing and Combinatorics. 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II

Type

Physical Book

Publisher

Springer Verlag, Singapore

Author

Fedor V. Fomin;Mingyu Xiao

Collection

Lecture Notes in Computer Science

Year

2025

Pages

399

Format

Paperback

Dimensions

23.50 x 15.50 cm

ISBN13

9789819502172

Computing and Combinatorics. 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II

Fedor V. Fomin;Mingyu Xiao (Author) · Springer Verlag, Singapore · Paperback

Cheaper New Book Imported to Austria

Delivery: 17 Jul - 24 Jul

75,41 €

Faster New Book Imported to Austria

Delivery: 07 Jul - 09 Jul

98,21 €

Import costs and 10% VAT included in the price ✅

75,41 €

Add to Wishlist

Synopsis "Computing and Combinatorics. 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 15–17, 2025, Proceedings, Part II"

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.