000 06011nam a22007095i 4500
001 978-3-030-83508-8
003 DE-He213
005 20240423125349.0
007 cr nn 008mamaa
008 210730s2021 sz | s |||| 0|eng d
020 _a9783030835088
_9978-3-030-83508-8
024 7 _a10.1007/978-3-030-83508-8
_2doi
050 4 _aQA76.9.D35
050 4 _aQ350-390
072 7 _aUMB
_2bicssc
072 7 _aGPF
_2bicssc
072 7 _aCOM021000
_2bisacsh
072 7 _aUMB
_2thema
072 7 _aGPF
_2thema
082 0 4 _a005.73
_223
082 0 4 _a003.54
_223
245 1 0 _aAlgorithms and Data Structures
_h[electronic resource] :
_b17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings /
_cedited by Anna Lubiw, Mohammad Salavatipour, Meng He.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXVI, 670 p. 187 illus., 112 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12808
505 0 _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π/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.
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.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aAlgorithms.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer graphics.
650 1 4 _aData Structures and Information Theory.
650 2 4 _aDesign and Analysis of Algorithms.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
700 1 _aLubiw, Anna.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSalavatipour, Mohammad.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aHe, Meng.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030835071
776 0 8 _iPrinted edition:
_z9783030835095
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v12808
856 4 0 _uhttps://doi.org/10.1007/978-3-030-83508-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177127
_d177127