Skip to main content
  • Conference proceedings
  • © 2019

Computing and Combinatorics

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

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)

Conference series link(s): COCOON: International Computing and Combinatorics Conference

Conference proceedings info: COCOON 2019.

Buy it now

Buying options

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

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

Table of contents (55 papers)

  1. A Simple Construction of Broadcast Graphs

    • Hovhannes A. Harutyunyan, Zhiyuan Li
    Pages 240-253
  2. Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts

    • Alessandro Hill, Stefan Voß, Roberto Baldacci
    Pages 266-278
  3. Max-Min 3-Dispersion Problems

    • Takashi Horiyama, Shin-ichi Nakano, Toshiki Saitoh, Koki Suetsugu, Akira Suzuki, Ryuhei Uehara et al.
    Pages 291-300
  4. Matching Cut in Graphs with Large Minimum Degree

    • Sun-Yuan Hsieh, Hoang-Oanh Le, Van Bang Le, Sheng-Lung Peng
    Pages 301-312
  5. Incremental Optimization of Independent Sets Under the Reconfiguration Framework

    • Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
    Pages 313-324
  6. Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems

    • Ashwin Jacob, Venkatesh Raman, Vibha Sahlot
    Pages 325-337
  7. Reoptimization of Path Vertex Cover Problem

    • Mehul Kumar, Amit Kumar, C. Pandu Rangan
    Pages 363-374
  8. The Seeding Algorithm for Functional k-Means Problem

    • Min Li, Yishui Wang, Dachuan Xu, Dongmei Zhang
    Pages 387-396
  9. APTER: Aggregated Prognosis Through Exponential Re-weighting

    • Yang Liu, Kristiaan Pelckmans
    Pages 425-436
  10. An Erdős–Pósa Theorem on Neighborhoods and Domination Number

    • Jayakrishnan Madathil, Pranabendu Misra, Saket Saurabh
    Pages 437-444
  11. On the Hardness of Reachability Reduction

    • Dongjing Miao, Zhipeng Cai
    Pages 445-455
  12. Give and Take: Adaptive Balanced Allocation for Peer Assessments

    • Hideaki Ohashi, Yasuhito Asano, Toshiyuki Shimizu, Masatoshi Yoshikawa
    Pages 456-468
  13. LIKE Patterns and Complexity

    • Holger Petersen
    Pages 469-477

Other Volumes

  1. Computing and Combinatorics

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.

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

Buy it now

Buying options

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