
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.
This volume presents research from the 27th International Conference on Computing and Combinatorics (COCOON 2021), held as a hybrid event in Tainan, Taiwan, in October 2021. The proceedings contain 56 carefully reviewed papers selected from 131 submissions, covering a wide range of topics in theoretical computer science and discrete mathematics. The research presented addresses fundamental problems and explores novel algorithms and applications within various sub-fields.
This collection of papers represents a snapshot of current research in computing and combinatorics, as presented at the COCOON 2021 conference. The selection of topics indicates a focus on theoretical computer science, algorithms, and discrete mathematics, suggesting a readership of academics, researchers, and advanced students in these fields. The inclusion of diverse sub-topics points to the broad applicability and ongoing development within these areas of study.
Page Count:
0
Publication Date:
2021-10-24
Publisher:
Springer International Publishing
ISBN-10:
3030895440
ISBN-13:
9783030895440
No comments yet. Be the first to share your thoughts!