LEADER 05389nam 22007575 450 001 9910842290403321 005 20240701120613.0 010 $a9789819705665 024 7 $a10.1007/978-981-97-0566-5 035 $a(CKB)30597577900041 035 $a(MiAaPQ)EBC31189600 035 $a(Au-PeEL)EBL31189600 035 $a(DE-He213)978-981-97-0566-5 035 $a(EXLCZ)9930597577900041 100 $a20240228d2024 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWALCOM: Algorithms and Computation $e18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18?20, 2024, Proceedings /$fedited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen 205 $a1st ed. 2024. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2024. 215 $a1 online resource (449 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14549 311 08$a9789819705658 320 $aIncludes bibliographical references and index. 327 $aRecent Research Activities on Algorithmic Foundations for Social Advancement -- Reasons to Fall (More) in Love with Combinatorial Reconfiguration -- Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle -- Quantum Graph Drawing -- Simultaneous Drawing of Layered Trees -- Fully Dynamic Algorithms for Euclidean Steiner Tree -- The Parameterized Complexity of Terminal Monitoring Set -- Generating cyclic 2-Gray codes for Fibonacci q-decreasing words -- On the Hardness of Gray Code Problems for Combinatorial Objects -- On MAX?SAT with Cardinality Constraint -- Minimizing Corners in Colored Rectilinear Grids -- On Layered Area-Proportional Rectangle Contact Representations -- Short Flip Sequences to Untangle Segments in the Plane -- Improved Approximation Algorithms for Cycle and Path Packings -- Exact and Approximate Hierarchical Hub Labeling -- Reconfiguration of Multisets with Applications to Bin Packing -- The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules -- Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis -- A bisection approach to subcubic maximum induced matching -- Stable and Dynamic Minimum Cuts -- Black Hole Search in Dynamic Cactus Graph -- Recognition and Isomorphism of Proper H-graphs for unicyclic H in FPT-time -- Canonization of a random circulant graph by counting walks -- Counting Vanishing Matrix-Vector Products -- Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs -- (t,s)-completely Independent Spanning Trees -- Orientable Burning Number of Graphs -- Dichotomies for Tree Minor Containment with Structural Parameters -- Structural Parameterizations of Vertex Integrity -- On the Complexity of List H-Packing for Sparse Graph Classes. 330 $aThis book constitutes the refereed proceedings of the 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, held in Kanazawa, Japan, during March 18?20, 2024. The 28 full papers presented in this book, together with two extended abstracts of invited talks, were carefully reviewed and selected from 80 submissions. They cover diverse areas of algorithms and computation, that is, approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, combinatorial reconfiguration, 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$aLecture Notes in Computer Science,$x1611-3349 ;$v14549 606 $aComputer science 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aAlgorithms 606 $aComputer graphics 606 $aInformation technology$xManagement 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aDesign and Analysis of Algorithms 606 $aComputer Graphics 606 $aComputer Application in Administrative Data Processing 615 0$aComputer science. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aAlgorithms. 615 0$aComputer graphics. 615 0$aInformation technology$xManagement. 615 14$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Graphics. 615 24$aComputer Application in Administrative Data Processing. 676 $a511.8 702 $aUehara$b Ryuhei 702 $aYamanaka$b Katsuhisa 702 $aYen$b Hsu-Chun$f1958- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910842290403321 996 $aWALCOM: Algorithms and Computation$9774152 997 $aUNINA