Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9797)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: COCOON 2016.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Database and Data Structures; Computational Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata.
Similar content being viewed by others
Keywords
Table of contents (50 papers)
-
Parameterized Complexity and Algorithms
Other volumes
-
Computing and Combinatorics
Editors and Affiliations
Bibliographic Information
Book Title: Computing and Combinatorics
Book Subtitle: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings
Editors: Thang N. Dinh, My T. Thai
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-42634-1
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Softcover ISBN: 978-3-319-42633-4Published: 20 July 2016
eBook ISBN: 978-3-319-42634-1Published: 19 July 2016
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 634
Number of Illustrations: 98 b/w illustrations
Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computation by Abstract Devices, Artificial Intelligence, Computer Communication Networks, Mathematical Logic and Formal Languages