Skip to main content
SpringerLink
Log in

Computing and Combinatorics

23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Yixin Cao

    1. Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jianer Chen

    1. Texas A&M University, College Station, 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 10392)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: COCOON 2017.

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 (56 papers)

  1. Front Matter

    Pages I-XXI
    Download chapter PDF

  2. COCOON 2017

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. A Time-Space Trade-Off for Triangulations of Points in the Plane

      • Hee-Kap Ahn, Nicola Baraldo, Eunjin Oh, Francesco Silvestri
      Pages 3-12

    3. An FPTAS for the Volume of Some \(\mathcal{V}\)-polytopes—It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes

      • Ei Ando, Shuji Kijima
      Pages 13-24

    4. Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing

      • Pradeesha Ashok, Aniket Basu Roy, Sathish Govindarajan
      Pages 25-37

    5. Depth Distribution in High Dimensions

      • Jérémy Barbay, Pablo Pérez-Lantero, Javiel Rojas-Ledesma
      Pages 38-49

    6. An Improved Lower Bound on the Growth Constant of Polyiamonds

      • Gill Barequet, Mira Shalah, Yufei Zheng
      Pages 50-61

    7. Constrained Routing Between Non-Visible Vertices

      • Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot
      Pages 62-74

    8. Deletion Graph Problems Based on Deadlock Resolution

      • Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton S. Souza
      Pages 75-86

    9. Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications

      • Sankardeep Chakraborty, Srinivasa Rao Satti
      Pages 87-98

    10. Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

      • Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski et al.
      Pages 99-111

    11. The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality

      • Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing
      Pages 112-123

    12. Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem

      • Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang
      Pages 124-136

    13. Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing

      • Zhou Chen, Yukun Cheng, Qi Qi, Xiang Yan
      Pages 137-149

    14. Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph

      • Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa
      Pages 150-161

    15. Reoptimization of Minimum Latency Problem

      • Wenkai Dai
      Pages 162-174

    16. Pure Nash Equilibria in Restricted Budget Games

      • Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik
      Pages 175-187

    17. A New Kernel for Parameterized Max-Bisection Above Tight Lower Bound

      • Qilong Feng, Senmin Zhu, Jianxin Wang
      Pages 188-199

    18. Information Complexity of the AND Function in the Two-Party and Multi-party Settings

      • Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You
      Pages 200-211

    19. Optimal Online Two-Way Trading with Bounded Number of Transactions

      • Stanley P. Y. Fung
      Pages 212-223
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

This book constitutes the refereed proceedings of the 23rd International Conference on Computing and Combinatorics, COCOON 2017, held in Hiong Kong, China, in August 2017. The 56 full papers papers presented in this book were carefully reviewed and selected from 119 submissions. The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computational
biology, computational geometry and number theory, graph theory, and parallel and distributed computing.

Editors and Affiliations

  • Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    Yixin Cao

  • Texas A&M University, College Station, USA

    Jianer Chen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation