Algorithms and Data Structures 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Friggstad, Zachary (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sack, Jörg-Rüdiger (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Salavatipour, Mohammad R. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2019.
• Έκδοση: 1st ed. 2019.
• Σειρά: Theoretical Computer Science and General Issues ; 11646
• Θέματα: Algorithms.; Data structures (Computer science).; Computer science-Mathematics.; Numerical analysis.; Computer graphics.; Computer communication systems.; Algorithm Analysis and Problem Complexity.; Data Structures.; Discrete Mathematics in Computer Science.; Numeric Computing.; Computer Graphics.; Computer Communication Networks.

This 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 submiss...

Πίνακας περιεχομένων:

• Graphs 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.