Skip to main content
SpringerLink
Log in

Combinatorial Optimization and Applications

12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Donghyun Kim

    1. Department of Computer Science, Kennesaw State University, Marietta, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. R. N. Uma

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Alexander Zelikovsky

    1. Department of Computer Science, Georgia State University, Atlanta, 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 11346)

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

Included in the following conference series:

Conference proceedings info: COCOA 2018.

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. Graph Theory

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Fast Approximation of Centrality and Distances in Hyperbolic Graphs

      • V. Chepoi, F. F. Dragan, M. Habib, Y. Vaxès, H. Alrasheed
      Pages 3-18

    3. Rectilinear Shortest Paths Among Transient Obstacles

      • Anil Maheshwari, Arash Nouri, Jörg-Rüdiger Sack
      Pages 19-34

    4. An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy

      • Kunihiro Wasa, Takeaki Uno
      Pages 35-45

    5. Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently

      • Fernanda Couto, Luís Felipe I. Cunha
      Pages 46-61

    6. On the Approximability of Time Disjoint Walks

      • Alexandre Bayen, Jesse Goodman, Eugene Vinitsky
      Pages 62-78

    7. Directed Path-Width of Sequence Digraphs

      • Frank Gurski, Carolin Rehs, Jochen Rethmann
      Pages 79-93

    8. New Results About the Linearization of Scaffolds Sharing Repeated Contigs

      • Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
      Pages 94-107

    9. Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problem

      • Cristina Bazgan, Paul Beaujean, Éric Gourdin
      Pages 108-122

    10. Bipartite Communities via Spectral Partitioning

      • Kelly B. Yancey, Matthew P. Yancey
      Pages 123-137

    11. Generating Algebraic Expressions for Labeled Grid Graphs

      • Mark Korenblit
      Pages 138-153

    12. Editing Graphs to Satisfy Diversity Requirements

      • Huda Chuangpishit, Manuel Lafond, Lata Narayanan
      Pages 154-168

    13. Computing a Rectilinear Shortest Path amid Splinegons in Plane

      • Tameem Choudhury, R. Inkulu
      Pages 169-182

    14. Graph Problems with Obligations

      • Alexis Cornet, Christian Laforest
      Pages 183-197

    15. Bipartizing with a Matching

      • Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme L. Szwarcfiter
      Pages 198-213

  3. Network Flow and Security

    1. Front Matter

      Pages 215-215
      Download chapter PDF

    2. Removing Undesirable Flows by Edge Deletion

      • Gleb Polevoy, Stojan Trajanovski, Paola Grosso, Cees de Laat
      Pages 217-232

    3. Min-Max-Flow Based Algorithm for Evacuation Network Planning in Restricted Spaces

      • Yi Hong, Jiandong Liu, Chuanwen Luo, Deying Li
      Pages 233-245

    4. Practical and Easy-to-Understand Card-Based Implementation of Yao’s Millionaire Protocol

      • Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone
      Pages 246-261
Back to top

Other volumes

  1. Combinatorial Optimization and Applications

Keywords

About this book

The conference proceeding  LNCS 11346 constitutes the refereed proceedings of the 12th International Conference on Combinatorial Optimization and Applications, COCOA 2018, held in Atlanta, GA, USA, in December 2018.

The 50 full papers presented were carefully reviewed and selected from 106 submissions. The papers cover most aspects of t graph algorithms, routing and network design problems, scheduling algorithms, network optimization, combinatorial algorithms, approximation algorithms, paths and connectivity problems and much more. 

Editors and Affiliations

  • Department of Computer Science, Kennesaw State University, Marietta, USA

    Donghyun Kim

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

    R. N. Uma

  • Department of Computer Science, Georgia State University, Atlanta, USA

    Alexander Zelikovsky

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation