Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings

Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings

by Thang N. Dinh, My T. Thai
ISBN-10:
3319426338
ISBN-13:
9783319426334
Pub. Date:
08/27/2016
Publisher:
Springer International Publishing
ISBN-10:
3319426338
ISBN-13:
9783319426334
Pub. Date:
08/27/2016
Publisher:
Springer International Publishing
Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings

Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings

by Thang N. Dinh, My T. Thai
$54.99
Current price is , Original price is $54.99. You
$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.


Overview

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.


Product Details

ISBN-13: 9783319426334
Publisher: Springer International Publishing
Publication date: 08/27/2016
Series: Lecture Notes in Computer Science , #9797
Edition description: 1st ed. 2016
Pages: 634
Product dimensions: 6.10(w) x 9.25(h) x (d)

Table of Contents

Game 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.- Logic, Algebra and Automata.

From the B&N Reads Blog

Customer Reviews