05202nam a22006015i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001700172072001600189072002300205072001500228245026500243250001800508264007200526300006600598336002600664337002600690338003600716347002400752490005900776505182700835520093102662650002903593650004203622650002603664650002403690650002303714650002303737650004703760650003403807650004603841650002403887650004603911650002303957650006703980700008404047700008904131700008304220710003404303773002604337776003604363776003604399830005904435856004604494912001404540912001504554912001404569999001704583978-981-97-0566-5DE-He21320251030111451.0cr nn 008mamaa240228s2024    si |    s    |||| 0|eng d  a97898197056659978-981-97-0566-57 a10.1007/978-981-97-0566-52doi 4aQA75.5-76.95 7aUYA2bicssc 7aCOM0140002bisacsh 7aUYA2thema10aWALCOM: Algorithms and Computationh[electronic resource] :b18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings /cedited by Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen.  a1st ed. 2024. 1aSingapore :bSpringer Nature Singapore :bImprint: Springer,c2024.  aXIII, 438 p. 93 illus., 73 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aLecture Notes in Computer Science,x1611-3349 ;v145490 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.  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. 0aComputer science.958552 0aComputer sciencexMathematics.964041 0aDiscrete mathematics. 0aNumerical analysis. 0aAlgorithms.958677 0aComputer graphics. 0aInformation technologyxManagement.95722314aTheory of Computation.96755224aDiscrete Mathematics in Computer Science.24aNumerical Analysis.24aDesign and Analysis of Algorithms.96729924aComputer Graphics.24aComputer Application in Administrative Data Processing.9665311 aUehara, Ryuhei.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9720041 aYamanaka, Katsuhisa.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9720051 aYen, Hsu-Chun.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9720062 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978981970565808iPrinted edition:z9789819705672 0aLecture Notes in Computer Science,x1611-3349 ;v1454940uhttps://doi.org/10.1007/978-981-97-0566-5  aZDB-2-SCS  aZDB-2-SXCS  aZDB-2-LNC  c57972d57972