Atjaunināt sīkdatņu piekrišanu

Computing and Combinatorics: 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 1517, 2025, Proceedings, Part I [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 349 pages, height x width: 235x155 mm, 59 Illustrations, black and white; XIV, 349 p. 59 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 15983
  • Izdošanas datums: 26-Aug-2025
  • Izdevniecība: Springer
  • ISBN-10: 9819502144
  • ISBN-13: 9789819502141
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 80,39 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Computing and Combinatorics: 31st International Computing and Combinatorics Conference, COCOON 2025, Chengdu, China, August 1517, 2025, Proceedings, Part I
  • Formāts: Paperback / softback, 349 pages, height x width: 235x155 mm, 59 Illustrations, black and white; XIV, 349 p. 59 illus., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 15983
  • Izdošanas datums: 26-Aug-2025
  • Izdevniecība: Springer
  • ISBN-10: 9819502144
  • ISBN-13: 9789819502141
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9789819502141.html

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.