WALCOM: Algorithms and Computation
15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
Published on 16. February 2021
XV, 334 pages
978-3-030-68211-8 (ISBN)
Description
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 diverseareas 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.
The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverseareas 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.
More details
Series
Edition
1st ed. 2021
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Product notice
Reflowable
Illustrations
XV, 334 p. 108 illus., 55 illus. in color.
ISBN-13
978-3-030-68211-8 (9783030682118)
DOI
10.1007/978-3-030-68211-8
Schweitzer Classification
Other editions
Additional editions
Ryuhei Uehara | Seok-Hee Hong | Subhas C. Nandy
WALCOM: Algorithms and Computation
15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
Book
01/2021
Springer
€53.49
Shipment within 7-9 days
Content
Invited talks.- Majority Spanning Trees, Cotrees and Their Applications.- New Transportation Problem on a Graph with Sending and Bringing-Back Operations.- Long papers.- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees.- On Short Fastest Paths in Temporal Graphs.- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.- The Bike Sharing Problem.- Efficient Generation of a Card-based Uniformly Distributed Random Derangement.- Compact Data Structures for Dedekind Groups and Finite Rings.- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game.- Faster Multi-Sided Boundary Labelling.- On the Geometric Red-Blue Set Cover Problem.- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes.- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes.- An Improvement of Reed's Treewidth Approximation.- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs.- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms.- Computing $L(p,1)$-Labeling with Combined Parameters.- On Compatible Matchings.- Upward Point Set Embeddings of Paths and Trees.- 2-colored Point-set Embeddings of Partial 2-trees.- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs.- APX-Hardness and Approximation for the $k$-Burning Number Problem.- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs.- Physical Zero-Knowledge Proof for Ripple Effect.- Cyclic Shift Problems on Graphs.- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles.
