Experimental and Efficient Algorithms

Improving Linear Programming Approaches for the Steiner Tree Problem.- Algorithms and Experiments on Colouring Squares of Planar Graphs.- Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem.- Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm.- An On-Line Algorithm for the Rectangle Packing Problem with Rejection.- New Lower and Upper Bounds for Graph Treewidth.- Search Data Structures for Skewed Strings.- Evaluation of Basic Protocols for Optical Smart Dust Networks.- Linear Time Local Improvements for Weighted Matchings in Graphs.- Experimental Studies of Graph Traversal Algorithms.- A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning.- Comparing Push- and Pull-Based Broadcasting.- Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location.- A Lazy Version of Eppstein's K Shortest Paths Algorithm.- Linear Algorithm for 3-Coloring of Locally Connected Graphs.- A Clustering Algorithm for Interval Graph Test on Noisy Data.- Core Instances for Testing: A Case Study.- The Reliable Algorithmic Software Challenge RASC.- A New Class of Greedy Heuristics for Job Shop Scheduling Problems.- Algorithmic Techniques for Memory Energy Reduction.- A Framework for Designing Approximation Algorithms for Scheduling Problems.- Analysis and Visualization of Social Networks.