000 05449nam a22005895i 4500
001 978-3-030-24766-9
003 DE-He213
005 20200812104613.0
007 cr nn 008mamaa
008 190712s2019 gw | s |||| 0|eng d
020 _a9783030247669
_9978-3-030-24766-9
024 7 _a10.1007/978-3-030-24766-9
_2doi
040 _cCUS
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms and Data Structures
_h[electronic resource] :
_b16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings /
_cedited by Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXX, 594 p. 416 illus., 95 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 ;
_v11646
505 0 _aGraphs in Nature -- Set Similarity - a Survey -- Concurrent Connected Components Algorithms: Recent Results and Open Problems -- Succinct Data Structures for Families of Interval Graphs -- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow -- Efficient Nearest-Neighbor Query and Clustering of Planar Curves -- Positive-Instance Driven Dynamic Programming for Graph Searching -- How to Morph a Tree on a Small Grid -- Approximating the robust bin-packing with budget uncertainty -- Rank-Select Indices Without Tears -- A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs -- A Framework for Vehicle Routing Approximation Schemes in Trees -- Avoidable Vertices and Edges in Graphs -- Plane Hop Spanners for Unit Disk Graphs -- On the Minimum Consistent Subset Problem -- Parameterized Complexity of Conict-free Graph Coloring -- Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy -- Hamiltonicity for convex shape Delaunay and Gabriel graphs -- Computing Maximum Independent Set on Outerstring Graphs and Their Relatives -- Online Bin Covering with Advice -- Stackelberg Packing Games -- Range closest-pair search in higher dimensions -- Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles -- Kernelization of Graph Hamiltonicity: Proper H-Graphs -- Weighted Throughput Maximization with Calibrations -- Maximizing Dominance in the Plane and its Applications -- Extending Upward Planar Graph Drawings -- Online Circle Packing -- Guess Free Maximization of Submodular and Linear Sums -- Efficient Second-Order Shape-Constrained Function Fitting -- Dynamic Online Dictionary Matching -- Balanced Stable Marriage: How Close is Close Enough? -- Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint -- Inventory Routing Problem with Facility Location -- A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space -- Geometric Firefighting in the Half-plane -- Most vital segment barriers -- Splaying Preorders and Postorders -- Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS -- Discrete Morse Theory for Computing Zigzag Persistence -- Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity -- Zip Trees -- Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
520 _aThis book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
650 0 _aAlgorithms.
650 0 _aData structures (Computer science).
650 0 _aComputer science—Mathematics.
650 0 _aNumerical analysis.
650 0 _aComputer graphics.
650 0 _aComputer communication systems.
650 1 4 _aAlgorithm Analysis and Problem Complexity.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I16021
650 2 4 _aData Structures.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I15017
650 2 4 _aDiscrete Mathematics in Computer Science.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I17028
650 2 4 _aNumeric Computing.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I1701X
650 2 4 _aComputer Graphics.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I22013
650 2 4 _aComputer Communication Networks.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I13022
700 1 _aFriggstad, Zachary.
700 1 _aSack, Jörg-Rüdiger.
700 1 _aSalavatipour, Mohammad R.
830 0 _aTheoretical Computer Science and General Issues ;
_v11646
856 4 0 _uhttps://doi.org/10.1007/978-3-030-24766-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c204330
_d204330