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. Front Matter
    Pages I-XIII
  2. Game Theory and Algorithms

    1. Front Matter
      Pages 1-1
    2. Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer
      Pages 3-14
    3. Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault
      Pages 15-26
    4. Eleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang
      Pages 39-51
  3. Parameterized Complexity and Algorithms

    1. Front Matter
      Pages 53-53
    2. Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
      Pages 55-66
    3. Jiří Fiala, Tomáš Gavenčiak, Dušan Knop, Martin Koutecký, Jan Kratochvíl
      Pages 67-78
    4. Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan
      Pages 92-102
  4. Database and Data Structures

    1. Front Matter
      Pages 103-103
    2. Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
      Pages 105-118
    3. Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
      Pages 119-130
    4. Debajyoti Bera, Rameshwar Pratap
      Pages 143-155
  5. Computational Complexity

    1. Front Matter
      Pages 157-157
    2. Vít Jelínek, Eva Jelínková, Jan Kratochvíl
      Pages 159-170
    3. Christian Engels, B. V. Raghavendra Rao
      Pages 171-181
    4. Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
      Pages 182-193

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