LEADER 05445nam 22007815 450 001 996647865403316 005 20250221115244.0 010 $a9789819628452 010 $a9819628458 024 7 $a10.1007/978-981-96-2845-2 035 $a(MiAaPQ)EBC31915070 035 $a(Au-PeEL)EBL31915070 035 $a(CKB)37663519800041 035 $a(DE-He213)978-981-96-2845-2 035 $a(OCoLC)1503844561 035 $a(EXLCZ)9937663519800041 100 $a20250221d2025 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aWALCOM: Algorithms and Computation $e19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28 ? March 2, 2025, Proceedings /$fedited by Shin-ichi Nakano, Mingyu Xiao 205 $a1st ed. 2025. 210 1$aSingapore :$cSpringer Nature Singapore :$cImprint: Springer,$d2025. 215 $a1 online resource (817 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v15411 311 08$a9789819628445 311 08$a981962844X 327 $aParameterized Voter Relevance in Facility Location Games with Tree Shaped Invitation Graphs -- Proportionally dense subgraphs parameterized hardness and efficiently solvable cases -- Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons -- On the approximability of graph visibility problems -- Algorithms for the Collaborative Delivery Problem with Monitored Constraints -- A Piecewise Approach for the Analysis of Exact Algorithms -- Parameterized Complexity of (d,r) Domination via Modular Decomposition -- Multipacking and broadcast domination on cactus graphs and its impact on hyperbolic graphs -- Evaluating Monotone Circuits on Surfaces -- Ranking and Unranking of the Planar Embeddings of a Planar Graph -- Optimal Uniform Shortest Path Sampling -- An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets using Suffix Automata -- Popularity on the 3D-Euclidean Stable Roommates -- Independent Set Reconfiguration Under Bounded Hop Token Jumping -- Approximation algorithms for non-sequential star packing problems -- Reconfiguration Using Generalized Token Jumping -- Parameterized Algorithms for the Spanning Forest Isomorphism (or Containment) on Tree Problems -- Min Sum Disjoint Paths on Subclasses of Chordal Graphs -- Maximize the Rightmost Digit Gray Codes for Restricted Growth Strings -- NP Completeness and Physical Zero Knowledge Proofs for Zeiger -- Abelian and stochastic sandpile models on complete bipartite graphs -- Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules -- A Unified Model of Congestion Games with Priorities Two Sided Markets with Ties, Finite and Non Affine Delay Functions, and Pure Nash Equilibria -- Dag like unit refutations in UTVPI Constraint Systems -- Online Contention Resolution Schemes for Size stochastic Knapsacks -- The Connected k Vertex One Center Problem on Graphs. 330 $aThis book LNCS 15411 constitutes the refereed proceedings of the 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, held in Chengdu, China, during February 28 ? March 2, 2025. The 26 full papers were carefully reviewed and selected from 68 submissions. WALCOM 2025 covered a wide range of topics, including approximation algorithms, algorithmic graph theory and combinatorics, algorithmic and combinatorial aspects of logic, combinatorial algorithms, combinatorial optimization, combinatorial reconfiguration, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms and complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v15411 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 $a004.0151 700 $aNakano$b Shin-ichi$01785302 701 $aXiao$b Mingyu$01785303 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996647865403316 996 $aWALCOM: Algorithms and Computation$94316875 997 $aUNISA