Skip to main content
SpringerLink
Log in

WALCOM: Algorithms and Computation

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

  • Conference proceedings
  • © 2021

Overview

Editors:
  1. Ryuhei Uehara

    1. Japan Advanced Institute of Science and Technology, Ishikawa, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Seok-Hee Hong

    1. University of Sydney, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Subhas C. Nandy

    1. Indian Statistical Institute, kolkata, India

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

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

Included in the following conference series:

Conference proceedings info: WALCOM 2021.

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

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Invited Talks

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Majority Spanning Trees, Cotrees and Their Applications

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

    3. A New Transportation Problem on a Graph with Sending and Bringing-Back Operations

      • Tetsuo Asano
      Pages 13-24

  3. Long Papers

    1. Front Matter

      Pages 25-25
      Download chapter PDF

    2. Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees

      • Haitao Wang, Yiming Zhao
      Pages 27-39

    3. On Short Fastest Paths in Temporal Graphs

      • Umesh Sandeep Danda, G. Ramakrishna, Jens M. Schmidt, M. Srikanth
      Pages 40-51

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

    5. The Bike Sharing Problem

      • Jurek Czyzowicz, Konstantinos Georgiou, Ryan Killick, Evangelos Kranakis, Danny Krizanc, Lata Narayanan et al.
      Pages 65-77

    6. Efficient Generation of a Card-Based Uniformly Distributed Random Derangement

      • Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone
      Pages 78-89

    7. Compact Data Structures for Dedekind Groups and Finite Rings

      • Bireswar Das, Shivdutt Sharma
      Pages 90-102

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

    9. Faster Multi-sided One-Bend Boundary Labelling

      • Prosenjit Bose, Saeed Mehrabi, Debajyoti Mondal
      Pages 116-128

    10. On the Geometric Red-Blue Set Cover Problem

      • Raghunath Reddy Madireddy, Subhas C. Nandy, Supantha Pandit
      Pages 129-141

    11. Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes

      • Toshiki Saitoh, Ryo Yoshinaka, Hans L. Bodlaender
      Pages 142-153

    12. r-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes

      • Soh Kumabe, Takanori Maehara
      Pages 154-165

    13. An Improvement of Reed’s Treewidth Approximation

      • Mahdi Belbasi, Martin Fürer
      Pages 166-181

    14. Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs

      • Frank Gurski, Dominique Komander, Marvin Lindemann
      Pages 182-194

    15. Overall and Delay Complexity of the CLIQUES and Bron-Kerbosch Algorithms

      • Alessio Conte, Etsuji Tomita
      Pages 195-207

    16. Computing L(p, 1)-Labeling with Combined Parameters

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

Other volumes

  1. WALCOM: Algorithms and Computation

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation