Front matter
259-272
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
Marcus Poggi de Aragão and Renato F. Werneck
83-103
A Time-Sensitive System for Black-Box Combinatorial Optimization
Vinhthuy Phan, Pavel Sumazin and Steven Skiena
55
A Compressed Breadth-First Search for Satisfiability
DoRon B. Motter and Igor L. Markov
43-59
Using Multi-level Graphs for Timetable Information in Railway Systems
Frank Schulz, Dorothea Wagner and Christos Zaroliagis
73-82
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation
Kirk Pruhs and Eric Wiewiora
67
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web
Massimiliano Curcio, Stefano Leonardi and Andrea Vitaletti
57-59
The Treewidth of Java Programs
Jens Gustedt, Ole A. Mæhle and Jan Arne Telle
60
Partitioning Planar Graphs with Costs and Weights
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo and Anil Maheshwari
63
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo and Giuseppe F. Italiano
105-120
Experimental Evaluation of a New Shortest Path Algorithm
Extended Abstract
Seth Pettie, Vijaya Ramachandran and Srinath Sridhar
121-168
Getting More from Out-of-Core Columnsort
Geeta Chaudhry and Thomas H. Cormen
273-295
Topological Sweep in Degenerate Cases
Eynat Rafalin, Diane Souvaine and Ileana Streinu
61-62
Acceleration of K-Means and Related Clustering Algorithms
Steven J. Phillips
66
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
Cecilia M. Procopiuc, Pankaj K. Agarwal and Sariel Har-Peled
56
An Improvement on Tree Selection Sort
Jingchao Chen
Back matter