Site best viewed with IE 6.0, Netscape 6.0, or Mozilla 1.4 or better


 

ALENEX 2004
Workshop on Algorithm Engineering and Experiments

Astor Crowne Plaza Hotel, New Orleans
January 10, 2003

8:00 - Continental Breakfast, Grand Ballroom A/B

9:00-9:20
Engineering a Cache-Oblivious Sorting Algorithm (pdf)
Gerth Brodal, Rolf Fagerberg and Kristoffer Vinther

9:20-9:40
The Robustness of the Sum-of-Squares Algorithm for Bin Packing (pdf)
M. Bender, B. Bradley, G. Jagannathan and K. Pillaipakkamnatt

9:40-10:00
Practical Aspects of Compressed Suffix Arrays and FM-index in Searching DNA Sequences (pdf)
Wing-Kai Hon, Tak-Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong and Siu-Ming Yiu

10:00-10:20
Faster Placement of Hydrogens in Protein Structures by Dynamic Programming (pdf)
Andrew Leaver-Fay, Yuanxin Liu and Jack Snoeyink

10:20-10:40
Coffee break (Grand Ballroom A/B)

10:40-11:00
An Experimental Analysis of a Compact Graph Representation (pdf)
Dan Blandford, Guy Blelloch and Ian Kash

11:00-11:20
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments (pdf)
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters and Chris T. Symons

11:20-11:40
Safe Separators for Treewidth (pdf)
Hans L. Bodlaender and Arie M.C.A. Koster

11:40-12:00
Efficient Implementation of a Hotlink Assignment Algorithm for Web Sites (pdf)
Artur Alves Pessoa, Eduardo Sany Laber and Críston de Souza

12:00-1:30
Lunch (attendees on their own)

1:30-2:30
Invited Plenary Speaker
Engineering Geometric Algorithms: Persistent Problems and Some Solutions
Dan Halperin, Tel Aviv University

2:30-2:40
Break

2:40-3:00
Experimental Comparison of Shortest Path Approaches for Timetable Information (pdf)
Evangelia Pyrga, Frank Schulz, Dorothea Wagner and Christos Zaroliagis

3:00-3:20
Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks (pdf)
Ron Gutman

3:20-3:40
Coffee break (Grand Ballroom A/B)

3:40-4:00
Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures (pdf)
Jean Cardinal and David Eppstein

4:00-4:20
Approximating the Visible Region of a Point on a Terrain (pdf)
Boaz Ben-Moshe, Paz Carmi and Matthew J. Katz

4:20-4:40
A Computation Framework for Handling Motion (pdf)
Leo Guibas, Menelaos Karavelas and Daniel Russel

4:40-5:00
Engineering a Sorted List Data Structure for 32 Bit Keys (pdf)
Roman Dementiev, Lutz Kettner, Jens Mehnert and Peter Sanders

5:00-6:00
Business meeting

6:00-8:00
SODA reception (Grand Ballroom D)

12/02/03