Skip to main content
SpringerLink
Log in
Book cover

Computing and Combinatorics

26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Donghyun Kim

    1. Georgia State University, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. R. N. Uma

    1. Department of Mathematics and Physics, North Carolina Central University, Durham, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Zhipeng Cai

    1. Computer Science, Georgia State University, Atlanta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Dong Hoon Lee

    1. Korea University, Seoul, Korea (Republic of)

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

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

Included in the following conference series:

Conference proceedings info: COCOON 2020.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (54 papers)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. Subspace Approximation with Outliers

    • Amit Deshpande, Rameshwar Pratap
    Pages 1-13

  3. Linear-Time Algorithms for Eliminating Claws in Graphs

    • Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira, Uéverton S. Souza, Jayme L. Szwarcfiter
    Pages 14-26

  4. A New Lower Bound for the Eternal Vertex Cover Number of Graphs

    • Jasine Babu, Veena Prabhakaran
    Pages 27-39

  5. Bounded-Degree Spanners in the Presence of Polygonal Obstacles

    • André van Renssen, Gladys Wong
    Pages 40-51

  6. End-Vertices of AT-free Bigraphs

    • Jan Gorzny, Jing Huang
    Pages 52-63

  7. Approaching Optimal Duplicate Detection in a Sliding Window

    • Rémi Géraud-Stewart, Marius Lombard-Platet, David Naccache
    Pages 64-84

  8. Computational Complexity Characterization of Protecting Elections from Bribery

    • Lin Chen, Ahmed Sunny, Lei Xu, Shouhuai Xu, Zhimin Gao, Yang Lu et al.
    Pages 85-97

  9. Coding with Noiseless Feedback over the Z-Channel

    • Christian Deppe, Vladimir Lebedev, Georg Maringer, Nikita Polyanskii
    Pages 98-109

  10. Path-Monotonic Upward Drawings of Graphs

    • Seok-Hee Hong, Hiroshi Nagamochi
    Pages 110-122

  11. Seamless Interpolation Between Contraction Hierarchies and Hub Labels for Fast and Space-Efficient Shortest Path Queries in Road Networks

    • Stefan Funke
    Pages 123-135

  12. Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane

    • Sanjana Agrawal, R. Inkulu
    Pages 136-148

  13. How Hard Is Completeness Reasoning for Conjunctive Queries?

    • Xianmin Liu, Jianzhong Li, Yingshu Li
    Pages 149-161

  14. Imbalance Parameterized by Twin Cover Revisited

    • Neeldhara Misra, Harshil Mittal
    Pages 162-173

  15. Local Routing in a Tree Metric 1-Spanner

    • Milutin Brankovic, Joachim Gudmundsson, André van Renssen
    Pages 174-185

  16. Deep Specification Mining with Attention

    • Zhi Cao, Nan Zhang
    Pages 186-197

  17. Constructing Independent Spanning Trees in Alternating Group Networks

    • Jie-Fu Huang, Sun-Yuan Hsieh
    Pages 198-209

  18. W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension

    • Johannes Blum
    Pages 210-221

  19. An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane

    • Patrick Eades, Julián Mestre
    Pages 222-233

  20. Quantum Speedup for the Minimum Steiner Tree Problem

    • Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall
    Pages 234-245
Back to top

Other volumes

  1. Computing and Combinatorics

Keywords

About this book

This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020.
Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 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

  • Georgia State University, Atlanta, USA

    Donghyun Kim

  • Department of Mathematics and Physics, North Carolina Central University, Durham, USA

    R. N. Uma

  • Computer Science, Georgia State University, Atlanta, USA

    Zhipeng Cai

  • Korea University, Seoul, Korea (Republic of)

    Dong Hoon Lee

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation