ALENEX 2002: San Francisco, CA, USA

David M. Mount, Clifford Stein (Eds.): Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised Papers. Lecture Notes in Computer Science 2409 Springer 2002, ISBN 3-540-43977-3 BibTeX

@proceedings{DBLP:conf/alenex/2002,
  editor    = {David M. Mount and
               Clifford Stein},
  title     = {Algorithm Engineering and Experiments, 4th International Workshop,
               ALENEX 2002, San Francicsco, CA, USA, January 4-5, 2002, Revised
               Papers},
  booktitle = {ALENEX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2409},
  year      = {2002},
  isbn      = {3-540-43977-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Marcus Poggi de Aragão, Renato Fonseca F. Werneck:
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs. 1-15
Electronic Edition (Springer LINK) BibTeX
Vinhthuy T. Phan, Pavel Sumazin, Steven Skiena:
A Time-Sensitive System for Black-Box Combinatorial Optimization. 16-18
Electronic Edition (Springer LINK) BibTeX
DoRon B. Motter, Igor L. Markov:
A Compressed Breadth-First Search for Satisfiability. 29-42
Electronic Edition (Springer LINK) BibTeX
Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis:
Using Multi-level Graphs for Timetable Information in Railway Systems. 43-59
Electronic Edition (Springer LINK) BibTeX
Kirk Pruhs, Eric Wiewiora:
Evaluating the Local Ratio Algorithm for Dynamic Storage Allocation. 60-70
Electronic Edition (Springer LINK) BibTeX
Massimiliano Curcio, Stefano Leonardi, Andrea Vitaletti:
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web. 71-85
Electronic Edition (Springer LINK) BibTeX
Jens Gustedt, Ole A. Mæhle, Jan Arne Telle:
The Treewidth of Java Programs. 86-97
Electronic Edition (Springer LINK) BibTeX
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari:
Partitioning Planar Graphs with Costs and Weights. 98-110
Electronic Edition (Springer LINK) BibTeX
Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe F. Italiano:
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. 111-125
Electronic Edition (Springer LINK) BibTeX
Seth Pettie, Vijaya Ramachandran, Srinath Sridhar:
Experimental Evaluation of a New Shortest Path Algorithm. 126-142
Electronic Edition (Springer LINK) BibTeX
Geeta Chaudhry, Thomas H. Cormen:
Getting More from Out-of-Core Columnsort. 143-154
Electronic Edition (Springer LINK) BibTeX
Eynat Rafalin, Diane L. Souvaine, Ileana Streinu:
Topological Sweep in Degenerate Cases. 155-165
Electronic Edition (Springer LINK) BibTeX
Steven J. Phillips:
Acceleration of K-Means and Related Clustering Algorithms. 166-177
Electronic Edition (Springer LINK) BibTeX
Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled:
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. 178-193
Electronic Edition (Springer LINK) BibTeX
Jingchao Chen:
An Improvement on Tree Selection Sort. 194-206
Electronic Edition (Springer LINK) BibTeX