LEADER 05280nam 22007335 450 001 9910483831703321 005 20240307231103.0 010 $a3-030-68211-0 024 7 $a10.1007/978-3-030-68211-8 035 $a(CKB)4100000011763324 035 $a(DE-He213)978-3-030-68211-8 035 $a(MiAaPQ)EBC6480182 035 $a(PPN)253858526 035 $a(EXLCZ)994100000011763324 100 $a20210130d2021 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWALCOM: Algorithms and Computation $e15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 ? March 2, 2021, Proceedings /$fedited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12635 311 0 $a3-030-68210-2 327 $aInvited 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. 330 $aThis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12635 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aApplication software 606 $aTheory of Computation 606 $aData Structures and Information Theory 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aComputer and Information Systems Applications 615 0$aComputer science. 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aApplication software. 615 14$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aComputer and Information Systems Applications. 676 $a005.1 702 $aUehara$b Ryuhei 702 $aHong$b Seok-Hee 702 $aNandy$b Subhas C. 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910483831703321 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNINA