Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3111

Invited Contributions.- Design and Analysis of Dynamic Multithreaded Algorithms.- Cache-Oblivious Algorithms and Data Structures.- Refereed Contributions.- Getting the Best Response for Your Erg.- Auctions with Budget Constraints.- Tight Approximability Results for Test Set Problems in Bioinformatics.- Robust Subgraphs for Trees and Paths.- Collective Tree Spanners of Graphs.- Optimally Competitive List Batching.- The Relative Worst Order Ratio Applied to Seat Reservation.- Online Maintenance of k-Medians and k-Covers on a Line.- Matching Polyhedral Terrains Using Overlays of Envelopes.- Independent Set of Intersection Graphs of Convex Objects in 2D.- Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion.- Construction of the Nearest Neighbor Embracing Graph of a Point Set.- Connectivity of Graphs Under Edge Flips.- Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity.- A Simple Linear-Time Modular Decomposition Algorithm for Graphs, Using Order Extension.- Railway Delay Management: Exploring Its Algorithmic Complexity.- Layered Heaps.- Melding Priority Queues.- An Algorithm for Cyclic Edge Connectivity of Cubic Graphs.- Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.- New Algorithms for Enumerating All Maximal Cliques.- The Multi-multiway Cut Problem.- The Bottleneck Problem with Minimum Quantity Commitments.- All-Norm Approximation for Scheduling on Identical Machines.- Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler.- Approximation Schemes for the Crane Scheduling Problem.- Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems.- A ( )–Approximation Algorithm for the Stable Marriage Problem.-Maximizing the Number of Packed Rectangles.- Two Space Saving Tricks for Linear Time LCP Array Computation.- Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.- Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks.- Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.- The Optimal Online Algorithms for Minimizing Maximum Lateness.- Power Assignment in Radio Networks with Two Power Levels.- Pointed Binary Encompassing Trees.- On Geometric Structure of Global Roundings for Graphs and Range Spaces.- External Connected Components.- Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.- Simplified External Memory Algorithms for Planar DAGs.

Includes supplementary material: sn.pub/extras