|
Friday, January 4, 2002
(Kyoto Room)
|
|
8:00-8:50
|
Continental breakfast
|
|
8:50-9:00
|
Opening remarks
|
Session 1
9:00-10:30
|
-
9:00-9:25
On the Implementation of MST-based Heuristics for the
Steiner Problem in Graphs
-
Marcus Poggi de Aragao and Renato F. Werneck
-
9:30-9:55
A Time-Sensitive System for Black-Box Combinatorial Optimization
-
Vinhthuy Phan, Pavel Sumazin, and Steven Skiena
-
10:00-10:25
A Compressed Breadth-First Search for Satisfiability
-
DoRon B. Motter and Igor L. Markov
|
|
10:30-11:00
|
Coffee Break
|
|
11:00-12:00
|
Invited talk: Cynthia Phillips, Sandia National Laboratories
Tools for Rapid Development of Integer-Programming
Applications
|
|
12:00-2:00
|
Lunch break
|
Session 2
2:00-3:30
|
-
2:00-2:25
Using Multi-Level Graphs for Timetable Information in Railway
Systems
-
Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
-
2:30-2:55
Evaluating the Local Ratio Algorithm for Dynamic Storage
-
Kirk Pruhs and Eric Wiewiora
-
3:00-3:25
An Experimental Study of Prefetching and Caching Algorithms for
the World Wide Web
-
Massimiliano Curcio, Stefano Leonardi, and Andrea Vitaletti
|
|
3:30-4:00
|
Coffee Break
|
Session 3
4:00-5:30
|
-
4:00-4:25
The Treewidth of Java Programs
-
Jens Gustedt, Ole A Maehle, and Jan Arne Telle
-
4:30-4:55
Partitioning Planar Graphs with Costs and Weights
-
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo and Anil Maheshwari
-
5:00-5:25
Maintaining Dynamic Minimum Spanning Trees: An Experimental Study
-
G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, and G. F. Italiano
|
|
6:00-7:00
|
Business meeting (Kyoto Room)
|
|
|
|
Saturday, January 5, 2002
(Osaka Room)
|
|
8:00-9:00
|
Continental breakfast
|
|
9:00-10:00
|
Invited talk: Martin Farach-Colton, Google
Algorithmic Challenges in Search Engines
|
|
10:00-10:30
|
Coffee Break
|
Session 4
10:30-12:00
|
-
10:30-10:55
Experimental Evaluation of a New Shortest Path Algorithm
-
Seth Pettie, Vijaya Ramachandran, and Srinath Sridhar
-
11:00-11:25
Getting More From Out-of-Core Columnsort
-
Geeta Chaudhry and Thomas H. Cormen
-
11:30-11:55
An Improvement on Tree Selection Sort
(Talk Cancelled)
-
Jingchao Chen
|
|
12:00-2:00
|
Lunch break
|
|
2:00-3:00
|
Invited talk: Michael Kass, Pixar
Algorithmic Challenges at Pixar
|
|
3:00-3:30
|
Coffee Break
|
Session 5
3:30-5:00
|
-
3:30-3:55
Topological Sweep in Degenerate Cases
-
Eynat Rafalin, Diane Souvaine, and Ileana Streinu
-
4:00-4:25
Acceleration of K-means and Related Clustering Algorithms
-
Steven Phillips
-
4:30-4:55
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
-
Cecilia M. Procopiuc, Pankaj K. Agarwal and Sariel Har-Peled
|
|
5:00
|
Workshop adjourns
|
