LEADER 06010nam 22007815 450 001 996542665403316 005 20230727174738.0 010 $a3-031-38906-9 024 7 $a10.1007/978-3-031-38906-1 035 $a(MiAaPQ)EBC30668298 035 $a(Au-PeEL)EBL30668298 035 $a(DE-He213)978-3-031-38906-1 035 $a(PPN)272250163 035 $a(EXLCZ)9927867636400041 100 $a20230727d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Data Structures$b[electronic resource] $e18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 ? August 2, 2023, Proceedings /$fedited by Pat Morin, Subhash Suri 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (732 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14079 311 08$aPrint version: Morin, Pat Algorithms and Data Structures Cham : Springer,c2023 9783031389054 327 $aGeometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. 330 $aThis book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14079 606 $aData structures (Computer science) 606 $aInformation theory 606 $aAlgorithms 606 $aComputer engineering 606 $aComputer networks 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aData Structures and Information Theory 606 $aDesign and Analysis of Algorithms 606 $aComputer Engineering and Networks 606 $aSymbolic and Algebraic Manipulation 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aData structures (Computer science). 615 0$aInformation theory. 615 0$aAlgorithms. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aData Structures and Information Theory. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Engineering and Networks. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a005.73 676 $a003.54 700 $aMorin$b Pat$0802741 701 $aSuri$b Subhash$01379894 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996542665403316 996 $aAlgorithms and Data Structures$93420335 997 $aUNISA