Skip to main content
  • Conference proceedings
  • © 2021

WALCOM: Algorithms and Computation

15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings

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

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 2021.

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 (26 papers)

  1. Front Matter

    Pages i-xv
  2. Invited Talks

    1. Front Matter

      Pages 1-1
    2. Majority Spanning Trees, Cotrees and Their Applications

      • Mohammad Kaykobad, F. J. M. Salzborn
      Pages 3-12
  3. Long Papers

    1. Front Matter

      Pages 25-25
    2. On Short Fastest Paths in Temporal Graphs

      • Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, M. Srikanth
      Pages 40-51
    3. Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights

      • Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
      Pages 52-64
    4. The Bike Sharing Problem

      • Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan et al.
      Pages 65-77
    5. Efficient Generation of a Card-Based Uniformly Distributed Random Derangement

      • Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone
      Pages 78-89
    6. Compact Data Structures for Dedekind Groups and Finite Rings

      • Bireswar Das, Shivdutt Sharma
      Pages 90-102
    7. Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game

      • Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist
      Pages 103-115
    8. Faster Multi-sided One-Bend Boundary Labelling

      • Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
      Pages 116-128
    9. On the Geometric Red-Blue Set Cover Problem

      • Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
      Pages 129-141
    10. Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes

      • Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
      Pages 142-153
    11. An Improvement of Reed’s Treewidth Approximation

      • Mahdi Belbasi, Martin Fürer
      Pages 166-181
    12. Computing L(p, 1)-Labeling with Combined Parameters

      • Tesshu Hanaka, Kazuma Kawai, Hirotaka Ono
      Pages 208-220

Other Volumes

  1. WALCOM: Algorithms and Computation

About this book

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. 
The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse
areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. 

Editors and Affiliations

  • Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    Ryuhei Uehara

  • University of Sydney, Sydney, Australia

    Seok-Hee Hong

  • Indian Statistical Institute, kolkata, India

    Subhas C. Nandy

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