|
|
|
|
LEADER |
04962nmm a2200481 u 4500 |
001 |
EB002169336 |
003 |
EBX01000000000000001307113 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
230808 ||| eng |
020 |
|
|
|a 9783031389061
|
100 |
1 |
|
|a Morin, Pat
|e [editor]
|
245 |
0 |
0 |
|a Algorithms and Data Structures
|h Elektronische Ressource
|b 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings
|c edited by Pat Morin, Subhash Suri
|
250 |
|
|
|a 1st ed. 2023
|
260 |
|
|
|a Cham
|b Springer Nature Switzerland
|c 2023, 2023
|
300 |
|
|
|a XII, 721 p. 163 illus., 121 illus. in color
|b online resource
|
505 |
0 |
|
|a 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 --
|
505 |
0 |
|
|a Geometric 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 --
|
505 |
0 |
|
|a Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs
|
505 |
0 |
|
|a 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 --
|
653 |
|
|
|a Computer graphics
|
653 |
|
|
|a Symbolic and Algebraic Manipulation
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Computer Graphics
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Data Structures and Information Theory
|
653 |
|
|
|a Computer networks
|
653 |
|
|
|a Computer Engineering and Networks
|
653 |
|
|
|a Design and Analysis of Algorithms
|
653 |
|
|
|a Information theory
|
653 |
|
|
|a Data structures (Computer science)
|
653 |
|
|
|a Computer engineering
|
653 |
|
|
|a Discrete mathematics
|
700 |
1 |
|
|a Suri, Subhash
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Lecture Notes in Computer Science
|
028 |
5 |
0 |
|a 10.1007/978-3-031-38906-1
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-031-38906-1?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 003.54
|
082 |
0 |
|
|a 005.73
|
520 |
|
|
|a This 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
|