Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 ProceedingsAuthor: Published by Springer Berlin Heidelberg ISBN: 978-3-540-67690-4 DOI: 10.1007/3-540-44985-XTable of Contents:Dynamic Graph Algorithms with Applications Coping with the NP-Hardness of the Graph Bandwidth Problem Toward Complete Genome Data Mining in Computational Biology A New Trade-Off for Deterministic Dictionaries Improved Upper Bounds for Pairing Heaps Maintaining Center and Median in Dynamic Trees Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n) Update Time A Dynamic Algorithm for Maintaining Graph Partitions Data Structures for Maintaining Set Partitions Fixed Parameter Algorithms for Planar Dominating Set and Related Problems Embeddings of k-Connected Graphs of Pathwidth k On Graph Powers for Leaf-Labeled Trees Recognizing Weakly Triangulated Graphs by Edge Separability Caching for Web Searching On-Line Scheduling with Precedence Constraints Scheduling Jobs Before Shut-Down Resource Augmentation in Load Balancing Fair versus Unrestricted Bin Packing A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs Approximation Algorithms for the Label-Cover MAX and Red-Blue Set Cover Problems