ALENEX'02

[Prof. David MOUNT]

This is a reminder that ALENEX'02 will be on Jan 4-5 2002, just prior to
SODA.  The early registration deadline in Dec 25, 2001.  For further
information visit:

    http://www.cs.umd.edu/~mount/ALENEX02/

Invited Speakers
----------------
Cynthia A. Phillips, Sandia National Laboratory
Martin Farach-Colton, Google

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 P., 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


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.