001472199 000__ 05893cam\\22006137i\4500
001472199 001__ 1472199
001472199 003__ OCoLC
001472199 005__ 20230908003400.0
001472199 006__ m\\\\\o\\d\\\\\\\\
001472199 007__ cr\un\nnnunnun
001472199 008__ 230802s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001472199 020__ $$a9783031389061$$q(electronic bk.)
001472199 020__ $$a3031389069$$q(electronic bk.)
001472199 020__ $$z9783031389054
001472199 0247_ $$a10.1007/978-3-031-38906-1$$2doi
001472199 035__ $$aSP(OCoLC)1391978432
001472199 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dEBLCP
001472199 049__ $$aISEA
001472199 050_4 $$aQA76.9.D35$$bW33 2023eb
001472199 08204 $$a005.73$$223/eng/20230802
001472199 1112_ $$aInternational Algorithms and Data Structures Symposium$$n(18th :$$d2023 :$$cMontréal, Québec)
001472199 24510 $$aAlgorithms and data structures :$$b18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31-August 2, 2023, Proceedings /$$cPat Morin, Subhash Suri, editors.
001472199 2463_ $$aWADS 2023
001472199 264_1 $$aCham, Switzerland :$$bSpringer,$$c2023.
001472199 300__ $$a1 online resource (xii, 721 pages) :$$billustrations (some color).
001472199 336__ $$atext$$btxt$$2rdacontent
001472199 337__ $$acomputer$$bc$$2rdamedia
001472199 338__ $$aonline resource$$bcr$$2rdacarrier
001472199 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v14079
001472199 500__ $$aIncludes author index.
001472199 5050_ $$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.
001472199 506__ $$aAccess limited to authorized users.
001472199 520__ $$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.
001472199 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 1, 2023).
001472199 650_0 $$aAlgorithms$$vCongresses.
001472199 650_0 $$aData structures (Computer science)$$vCongresses.
001472199 655_0 $$aElectronic books.
001472199 7001_ $$aMorin, Pat,$$eeditor.$$1https://orcid.org/0000-0003-0471-4118
001472199 7001_ $$aSuri, Subhash,$$eeditor.$$0(orcid)0000-0002-5668-7521$$1https://orcid.org/0000-0002-5668-7521
001472199 830_0 $$aLecture notes in computer science ;$$v14079.$$x1611-3349
001472199 852__ $$bebk
001472199 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-38906-1$$zOnline Access$$91397441.1
001472199 909CO $$ooai:library.usi.edu:1472199$$pGLOBAL_SET
001472199 980__ $$aBIB
001472199 980__ $$aEBOOK
001472199 982__ $$aEbook
001472199 983__ $$aOnline
001472199 994__ $$a92$$bISE