List of Accepted Papers
-
An Improvement on Tree Selection Sort,
Jingchao Chen.
-
Evaluating the Local Ratio Algorithm for Dynamic Storage,
Kirk Pruhs and Eric Wiewiora.
-
Topological Sweep in Degenerate Cases,
Eynat Rafalin, Diane Souvaine, and Ileana Streinu.
-
Using Multi-Level Graphs for Timetable Information in Railway Systems,
Frank Schulz, Dorothea Wagner, and Christos Zaroliagis.
-
Acceleration of K-means and Related Clustering Algorithms,
Steven Phillips.
-
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects,
Cecilia M. Procopiuc, Pankaj K. Agarwal and Sariel Har-Peled.
-
On the Implementation of MST-based Heuristics for the Steiner Problem in Graphs,
Marcus Poggi de Aragao and Renato F. Werneck.
-
Experimental Evaluation of a New Shortest Path Algorithm,
Seth Pettie, Vijaya Ramachandran, and Srinath Sridhar.
-
The Treewidth of Java Programs,
Jens Gustedt, Ole A Maehle, and Jan Arne Telle.
-
A Time-Sensitive System for Black-Box Combinatorial Optimization,
Vinhthuy Phan, Pavel Sumazin, and Steven Skiena.
-
An Experimental Study of Prefetching and Caching Algorithms for the World Wide
Web,
Massimiliano Curcio, Stefano Leonardi, and Andrea Vitaletti.
-
Getting More From Out-of-Core Columnsort,
Geeta Chaudhry and Thomas H. Cormen.
-
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study,
G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, and G. F. Italiano.
-
A Compressed Breadth-First Search for Satisfiability,
DoRon B. Motter and Igor L. Markov.
-
Partitioning Planar Graphs with Costs and Weights,
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo and Anil Maheshwari.