Computing and Combinatorics

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

  • Thang N. Dinh
  • My T. Thai

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9797)

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9797)

Table of contents

  1. Scheduling Algorithms and Circuit Complexity

    1. Majid Khonji, Areg Karapetyan, Khaled Elbassioni, Chi-Kin Chau
      Pages 496-509
    2. Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram
      Pages 510-519
    3. Vincent Chau, Ken C. K. Fong, Minming Li, Kai Wang
      Pages 520-531
  2. Computational Geometry and Computational Biology

    1. Front Matter
      Pages 533-533
    2. Sutanu Gayen, N. V. Vinodchandran
      Pages 535-546
    3. Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi, Sahar Mehrpour, Debajyoti Mondal
      Pages 547-559
    4. Nikita Alexeev, Max A. Alekseyev
      Pages 560-572
    5. Jucheol Moon, Iddo Friedberg, Oliver Eulenstein
      Pages 573-584
  3. Logic, Algebra and Automata

    1. Front Matter
      Pages 585-585
    2. Andreas Krebs, Nutan Limaye, Michael Ludwig
      Pages 587-598
    3. Xinfeng Shu, Zhenhua Duan
      Pages 599-610
    4. Yao Liu, Zhenhua Duan, Cong Tian, Bin Cui
      Pages 611-622
    5. Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li
      Pages 623-632
  4. Back Matter
    Pages 633-634

About these proceedings


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.


bioinformatics computational complexity cryptography social networks approximation algorithms

Editors and affiliations

  • Thang N. Dinh
    • 1
  • My T. Thai
    • 2
  1. 1.Virginia Commonwealth Univ RichmondUSA
  2. 2.University of Florida GainesvilleUSA

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-42633-4
  • Online ISBN 978-3-319-42634-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software