001438652 000__ 05862cam\a2200625\i\4500
001438652 001__ 1438652
001438652 003__ OCoLC
001438652 005__ 20230309004346.0
001438652 006__ m\\\\\o\\d\\\\\\\\
001438652 007__ cr\cn\nnnunnun
001438652 008__ 210802s2021\\\\sz\\\\\\o\\\\\101\0\eng\d
001438652 019__ $$a1263029192
001438652 020__ $$a9783030835088$$q(electronic bk.)
001438652 020__ $$a3030835081$$q(electronic bk.)
001438652 020__ $$z3030835073
001438652 020__ $$z9783030835071
001438652 0247_ $$a10.1007/978-3-030-83508-8$$2doi
001438652 035__ $$aSP(OCoLC)1262554451
001438652 040__ $$aYDX$$beng$$erda$$epn$$cYDX$$dGW5XE$$dEBLCP$$dYDX$$dOCLCO$$dOCLCF$$dOCLCO$$dCOM$$dOCLCQ$$dOCLCO$$dOCLCQ
001438652 049__ $$aISEA
001438652 050_4 $$aQA76.9.D35$$bW33 2021eb
001438652 08204 $$a005.73$$223
001438652 1112_ $$aInternational Algorithms and Data Structures Symposium$$n(17th :$$d2021 :$$cOnline)
001438652 24510 $$aAlgorithms and data structures :$$b17th International Symposium, WADS 2021, Virtual event, August 9-11, 2021, Proceedings /$$cAnna Lubiw, Mohammad Salavatipour (eds.).
001438652 2463_ $$aWADS 2021
001438652 264_1 $$aCham :$$bSpringer,$$c2021.
001438652 300__ $$a1 online resource
001438652 336__ $$atext$$btxt$$2rdacontent
001438652 337__ $$acomputer$$bc$$2rdamedia
001438652 338__ $$aonline resource$$bcr$$2rdacarrier
001438652 4901_ $$aLecture notes in computer science ;$$v12808
001438652 4901_ $$aLNCS sublibrary, SL 1, Theoretical computer science and general issues
001438652 500__ $$aIncludes author index.
001438652 5050_ $$aAdjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed 6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2[pi]/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane--local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs.
001438652 506__ $$aAccess limited to authorized users.
001438652 520__ $$aThis book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.
001438652 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 10, 2021).
001438652 650_0 $$aAlgorithms$$vCongresses.
001438652 650_0 $$aData structures (Computer science)$$vCongresses.
001438652 650_6 $$aAlgorithmes$$vCongrès.
001438652 650_6 $$aStructures de données (Informatique)$$vCongrès.
001438652 655_7 $$aConference papers and proceedings.$$2fast$$0(OCoLC)fst01423772
001438652 655_7 $$aConference papers and proceedings.$$2lcgft
001438652 655_7 $$aActes de congrès.$$2rvmgf
001438652 655_0 $$aElectronic books.
001438652 7001_ $$aLubiw, Anna,$$d1957-$$eeditor$$1https://orcid.org/0000-0002-2338-361X
001438652 7001_ $$aSalavatipour, Mohammad R.,$$eeditor$$1https://orcid.org/0000-0002-7650-2045
001438652 830_0 $$aLecture notes in computer science ;$$v12808.
001438652 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
001438652 852__ $$bebk
001438652 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-83508-8$$zOnline Access$$91397441.1
001438652 909CO $$ooai:library.usi.edu:1438652$$pGLOBAL_SET
001438652 980__ $$aBIB
001438652 980__ $$aEBOOK
001438652 982__ $$aEbook
001438652 983__ $$aOnline
001438652 994__ $$a92$$bISE