Skip to main content
  • Conference proceedings
  • © 2020

WALCOM: Algorithms and Computation

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

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)

Conference series link(s): WALCOM: International Conference and Workshops on Algorithms and Computation

Conference proceedings info: WALCOM 2020.

Buy it now

Buying options

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

  1. Front Matter

    Pages i-xiii
  2. Invited Talks

    1. Front Matter

      Pages 1-1
    2. Drawing Planar Graphs

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

    1. Front Matter

      Pages 29-29
    2. Routing in Histograms

      • Man-Kwun Chiu, Jonas Cleve, Katharina Klost, Matias Korman, Wolfgang Mulzer, André van Renssen et al.
      Pages 43-54
    3. 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
    4. 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
    5. Angle Covers: Algorithms and Complexity

      • William Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
      Pages 94-106
    6. Fast Multiple Pattern Cartesian Tree Matching

      • Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park
      Pages 107-119
    7. Reconfiguring k-path Vertex Covers

      • Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita
      Pages 133-145
    8. Maximum Bipartite Subgraph of Geometric Intersection Graphs

      • Satyabrata Jana, Anil Maheshwari, Saeed Mehrabi, Sasanka Roy
      Pages 158-169
    9. The Stub Resolution of 1-Planar Graphs

      • Michael Kaufmann, Jan Kratochvil, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi Raftopoulou, Pavel Valtr
      Pages 170-182
    10. Dispersion of Mobile Robots on Grids

      • Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma
      Pages 183-197
    11. Packing and Covering with Segments

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

Other Volumes

  1. WALCOM: Algorithms and Computation

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.

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

Bibliographic Information

Buy it now

Buying options

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