LEADER 06515nam 22008895 450 001 996465835703316 005 20230406034142.0 010 $a1-282-33200-7 010 $a9786612332005 010 $a3-642-03367-9 024 7 $a10.1007/978-3-642-03367-4 035 $a(CKB)1000000000761213 035 $a(EBL)450538 035 $a(OCoLC)437347237 035 $a(SSID)ssj0000288526 035 $a(PQKBManifestationID)11242701 035 $a(PQKBTitleCode)TC0000288526 035 $a(PQKBWorkID)10382547 035 $a(PQKB)11050335 035 $a(DE-He213)978-3-642-03367-4 035 $a(MiAaPQ)EBC450538 035 $a(MiAaPQ)EBC6413349 035 $a(PPN)13631094X 035 $a(EXLCZ)991000000000761213 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Data Structures$b[electronic resource] $e11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings /$fedited by Frank Dehne, Jörg-Rüdiger Sack, Csaba D. Toth 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (588 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5664 300 $aDescription based upon print version of record. 311 $a3-642-03366-0 320 $aIncludes bibliographical references and index. 327 $aOn the Power of the Semi-Separated Pair Decomposition -- Plane Graphs with Parity Constraints -- Straight-Line Rectangular Drawings of Clustered Graphs -- Online Priority Steiner Tree Problems -- Connect the Dot: Computing Feed-Links with Minimum Dilation -- Minimal Locked Trees -- Approximating Transitive Reductions for Directed Networks -- 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2 -- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing -- A Distribution-Sensitive Dictionary with Low Space Overhead -- A Comparison of Performance Measures for Online Algorithms -- Delaunay Triangulation of Imprecise Points Simplified and Extended -- An Improved SAT Algorithm in Terms of Formula Length -- Shortest Path Problems on a Polyhedral Surface -- Approximation Algorithms for Buy-at-Bulk Geometric Network Design -- Rank-Sensitive Priority Queues -- Algorithms Meet Art, Puzzles, and Magic -- Skip-Splay: Toward Achieving the Unified Bound in the BST Model -- Drawing Graphs with Right Angle Crossings -- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance -- Efficient Construction of Near-Optimal Binary and Multiway Search Trees -- On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem -- On Reconfiguration of Disks in the Plane and Related Problems -- Orientation-Constrained Rectangular Layouts -- The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics -- Optimal Embedding into Star Metrics -- Online Square Packing -- Worst-Case Optimal Adaptive Prefix Coding -- New Results on Visibility in Simple Polygons -- Dynamic Graph Clustering Using Minimum-Cut Trees -- Rank-Balanced Trees -- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments -- Reconfiguration of List Edge-Colorings in a Graph -- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs -- Two for One: Tight Approximation of 2D Bin Packing -- Fault Tolerant External Memory Algorithms -- Inspecting a Set of Strips Optimally -- A Pseudopolynomial Algorithm for Alexandrov?s Theorem -- A Scheme for Computing Minimum Covers within Simple Regions -- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality -- Streaming Embeddings with Slack -- Computing the Implicit Voronoi Diagram in Triple Precision -- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms -- Integer Programming: Optimization and Evaluation Are Equivalent -- Resolving Loads with Positive Interior Stresses -- On Making Directed Graphs Transitive -- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees -- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs. 330 $aThis book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5664 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence?Data processing 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aNumerical analysis 606 $aProgramming Techniques 606 $aAlgorithms 606 $aData Science 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 606 $aNumerical Analysis 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence?Data processing. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 0$aNumerical analysis. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 615 24$aNumerical Analysis. 676 $a511.3 702 $aDehne$b Frank 712 12$aWADS 2009 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465835703316 996 $aAlgorithms and Data Structures$91967417 997 $aUNISA