Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

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

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Thang N. Dinh

    1. Virginia Commonwealth Univ , Richmond, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. My T. Thai

    1. University of Florida , Gainesville, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (50 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Game Theory and Algorithms

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Clairvoyant Mechanisms for Online Auctions

      • Philipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer
      Pages 3-14

    3. Truthfulness for the Sum of Weighted Completion Times

      • Eric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault
      Pages 15-26

    4. Network Topologies for Weakly Pareto Optimal Nonatomic Selfish Routing

      • Xujin Chen, Zhuo Diao
      Pages 27-38

    5. New Results for Network Pollution Games

      • 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
      Download chapter PDF

    2. Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three

      • Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy
      Pages 55-66

    3. Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems

      • Jiří Fiala, Tomáš Gavenčiak, Dušan Knop, Martin Koutecký, Jan Kratochvíl
      Pages 67-78

    4. A Parameterized Algorithm for Bounded-Degree Vertex Deletion

      • Mingyu Xiao
      Pages 79-91

    5. The Monotone Circuit Value Problem with Bounded Genus Is in NC

      • 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
      Download chapter PDF

    2. Locality-Sensitive Hashing Without False Negatives for \(l_p\)

      • Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
      Pages 105-118

    3. Improved Space Efficient Algorithms for BFS, DFS and Applications

      • Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman
      Pages 119-130

    4. Metric 1-Median Selection: Query Complexity vs. Approximation Ratio

      • Ching-Lueh Chang
      Pages 131-142

    5. Frequent-Itemset Mining Using Locality-Sensitive Hashing

      • Debajyoti Bera, Rameshwar Pratap
      Pages 143-155

  5. Computational Complexity

    1. Front Matter

      Pages 157-157
      Download chapter PDF

    2. On the Hardness of Switching to a Small Number of Edges

      • Vít Jelínek, Eva Jelínková, Jan Kratochvíl
      Pages 159-170

    3. On Hard Instances of Non-Commutative Permanent

      • Christian Engels, B. V. Raghavendra Rao
      Pages 171-181

    4. The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model

      • Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
      Pages 182-193
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

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.

Editors and Affiliations

  • Virginia Commonwealth Univ , Richmond, USA

    Thang N. Dinh

  • University of Florida , Gainesville, USA

    My T. Thai

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation