[go: up one dir, main page]
Skip to main content
Springer Nature Link
Account

WALCOM: Algorithms and Computation

14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. M. Sohel Rahman

    1. Department of CSE, BUET, Dhaka, Bangladesh

  2. Kunihiko Sadakane

    1. Mathematical Informatics, University of Tokyo, Tokyo, Japan

  3. Wing-Kin Sung

    1. School of Computing, National University of Singapore, Singapore, Singapore

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12049)

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

Included in the following conference series:

Conference proceedings info: WALCOM 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 EUR 53.49
Price includes VAT (France)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book EUR 69.62
Price includes VAT (France)
  • 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 refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020.
The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects.

Table of contents (30 papers)

  1. Front Matter

    Pages i-xiii
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Drawing Planar Graphs

      • Md. Saidur Rahman, Md. Rezaul Karim
      Pages 3-14

    3. Space Efficient Separator Algorithms for Planar Graphs

      • Osamu Watanabe
      Pages 15-21

    4. Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks

      • Louxin Zhang
      Pages 22-27

  3. Long Papers

    1. Front Matter

      Pages 29-29
      Download chapter PDF

    2. Optimum Algorithm for the Mutual Visibility Problem

      • Subhash Bhagat
      Pages 31-42

    3. Routing in Histograms

      • Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen et al.
      Pages 43-54

    4. A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic Chips

      • Miguel Coviello Gonzalez, Marek Chrobak
      Pages 55-68

    5. Shortest Covers of All Cyclic Shifts of a String

      • Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń et al.
      Pages 69-80

    6. Packing Trees into 1-Planar Graphs

      • Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong, Stephen Kobourov, William Lenhart, Giuseppe Liotta et al.
      Pages 81-93

    7. Angle Covers: Algorithms and Complexity

      • William Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
      Pages 94-106

    8. Fast Multiple Pattern Cartesian Tree Matching

      • Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
      Pages 107-119

    9. Generalized Dictionary Matching Under Substring Consistent Equivalence Relations

      • Diptarama Hendrian
      Pages 120-132

    10. Reconfiguring k-path Vertex Covers

      • Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
      Pages 133-145

    11. Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons

      • Chuzo Iwamoto, Tatsuaki Ibusuki
      Pages 146-157

    12. Maximum Bipartite Subgraph of Geometric Intersection Graphs

      • Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
      Pages 158-169

    13. The Stub Resolution of 1-Planar Graphs

      • Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr
      Pages 170-182

    14. Dispersion of Mobile Robots on Grids

      • Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
      Pages 183-197

    15. Packing and Covering with Segments

      • Joseph S. B. Mitchell, Supantha Pandit
      Pages 198-210
Back to top

Other volumes

  1. WALCOM: Algorithms and Computation

Editors and Affiliations

  • Department of CSE, BUET, Dhaka, Bangladesh

    M. Sohel Rahman

  • Mathematical Informatics, University of Tokyo, Tokyo, Japan

    Kunihiko Sadakane

  • School of Computing, National University of Singapore, Singapore, Singapore

    Wing-Kin Sung

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Keywords

Publish with us

Policies and ethics

Back to top