<p>This two-volume set, LNCS <span class="mx-text mx-name-text_SeriesVolumeDetails2">15983</span> and <span class="mx-text mx-name-text_SeriesVolumeDetails2">15984</span>, constitutes the referred proceedings of the 31st International Computing and Combinatorics Conference, COCOON 2025, held in Chengdu, China, during August 15–17, 2025.</p><p>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:<br>Part I: Approximation Algorithms, Combinatorial Optimization, Computational Complexity, Computational Geometry, Economics and Computation.<br>Part II: Graph Algorithms and Graph Theory, Learning and Data-Related Theory, Parameterized Algorithms, String Algorithms and Discrete Structures.</br></br></p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Computing and Combinatorics

摘要

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.