Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Computing and Combinatorics

25th International Conference, COCOON 2019, Xi'an, China, July 29–31, 2019, Proceedings

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. Ding-Zhu Du

    1. The University of Texas at Dallas, Richardson, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Zhenhua Duan

    1. Xidian University, Xi'an, China

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Cong Tian

    1. Xidian University, Xi'an, China

    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 11653)

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

Included in the following conference series:

Conference proceedings info: COCOON 2019.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

About this book

This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi’an, China, in July 2019.
The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory.

Similar content being viewed by others

Keywords

Table of contents (55 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Fully Dynamic Arboricity Maintenance

    • Niranka Banerjee, Venkatesh Raman, Saket Saurabh
    Pages 1-12

  3. A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice

    • Gill Barequet, Minati De
    Pages 13-24

  4. An FPTAS for a General Class of Parametric Optimization Problems

    • Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten
    Pages 25-37

  5. Geodesic Fault-Tolerant Additive Weighted Spanners

    • Sukanya Bhattacharjee, R. Inkulu
    Pages 38-51

  6. Diameter of Colorings Under Kempe Changes

    • Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler et al.
    Pages 52-64

  7. Dominating Set on Overlap Graphs of Rectangles Intersecting a Line

    • Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee
    Pages 65-77

  8. Minimizing the Cost of Batch Calibrations

    • Vincent Chau, Minming Li, Yinling Wang, Ruilong Zhang, Yingchao Zhao
    Pages 78-89

  9. Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

    • Prasad Chaugule, Nutan Limaye, Aditya Varre
    Pages 90-102

  10. Chance-Constrained Submodular Knapsack Problem

    • Junjie Chen, Takanori Maehara
    Pages 103-114

  11. Approximation Hardness of Travelling Salesman via Weighted Amplifiers

    • Miroslav Chlebík, Janka Chlebíková
    Pages 115-127

  12. Deleting to Structured Trees

    • Pratyush Dayal, Neeldhara Misra
    Pages 128-139

  13. Sensitivity, Affine Transforms and Quantum Communication Complexity

    • Krishnamoorthy Dinesh, Jayalal Sarma
    Pages 140-152

  14. On Exactly Learning Disjunctions and DNFs Without Equivalence Queries

    • Ning Ding
    Pages 153-165

  15. Interactive Physical Zero-Knowledge Proof for Norinori

    • Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone
    Pages 166-177

  16. On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models

    • Purnata Ghosal, B. V. Raghavendra Rao
    Pages 178-192

  17. Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties

    • Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, T. Pradeep Reddy
    Pages 193-205

  18. Feasibility Algorithms for the Duplication-Loss Cost

    • Paweł Górecki, Alexey Markin, Oliver Eulenstein
    Pages 206-218

  19. Imbalance, Cutwidth, and the Structure of Optimal Orderings

    • Jan Gorzny, Jonathan F. Buss
    Pages 219-231

  20. Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs

    • Grzegorz Guśpiel
    Pages 232-239
Back to top

Other volumes

  1. Computing and Combinatorics

Editors and Affiliations

  • The University of Texas at Dallas, Richardson, USA

    Ding-Zhu Du

  • Xidian University, Xi'an, China

    Zhenhua Duan, Cong Tian

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation