Algorithms and Data Structures(算法与数据结构/会议录)

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005, held in Waterloo, Canada, in August 2005. The 37 revised full papers presented were carefully reviewed and selected from 90 submissions. A broad variety of topics in algorithmics and data structures is addressed including searching and sorting, approximation, graph and network computations, computational geometry, randomization, communications, combinatorial optimization, scheduling, routing, navigation, coding, and pattern matching.

Session 1
　Towards a Theory of Algorithms
Session 2A
　k-Restricted Rotation with an Application to Search Tree Rebalancing
　Heap Building Bounds
Session 2B
　The Multi-radius Cover Problem
　Parameterized Complexity of Generalized Vertex Cover Problems
　The Complexity of Implicit and Space Efficient Priority Queues
　Analysis of a Class of Tries with Adaptive Multi-digit Branching
　Balanced Aspect Ratio Trees Revisited
Session 3B
　Improved Combinatorial Group Testing for Real-World Problem Sizes
　Parameterized Counting Algorithms for General Graph Covering Problems
Approximating the Online Set Multicover Problems via Randomized Winnowing
Session 4A
Max-stretch Reduction for Tree Spanners
Succinct Representation of Triangulations with a Boundary
Line-Segment Intersection Made In-Place
Session 4B
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Communication-Aware Processor Allocation for Supercomputers
Dynamic Hotlinks
Session 5
Invited Presentation (No paper available)
Session 6A
The Minimum-Area Spanning Tree Problem
Hinged Dissection of Polypolyhedra
Session 6B
Session 7A
Session 7B
Session 8A
Session 8B
Session 9A
Session 9B
Author Index