ALENEX'04 accepted papers

From: Lars A. Arge (large_at_cs.duke.edu)
Date: 12/03/03 

Date: 02 Dec 2003 20:43:33 -0500

Papers accepted for presentation at the
6th Workshop on Algorithm Engineering and Experiments (ALENEX'04).

January 10, 2004, Astor Crown Plaza Hotel, New Orleans, Louisiana.
http://www.siam.org/meetings/alenex04. 

---
Engineering a Cache-Oblivious Sorting Algorithm
Gerth Brodal, Rolf Fagerberg and Kristoffer Vinther
The Robustness of the Sum-of-Squares Algorithm for Bin Packing
M. Bender, B. Bradley, G. Jagannathan and K. Pillaipakkamnatt
Practical Aspects of Compressed Suffix Arrays and FM-index in Searching DNA
Sequences
Wing-Kai Hon, Tak-Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong and
Siu-Ming Yiu
Faster placement of hydrogens in protein structures by dynamic programming
Andrew Leaver-Fay, Yuanxin Liu and Jack Snoeyink
An Experimental Analysis of a Compact Graph Representation
Dan Blandford, Guy Blelloch and Ian Kash
Kernelization Algorithms for the Vertex Cover Problem: Theory and
Experiments
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows and Michael
A. Langston
Safe Separators for Treewidth
Hans L. Bodlaender and Arie M.C.A. Koster
Efficient Implementation of a Hotlink Assignment Algorithm for Web Sites
Artur Alves Pessoa, Eduardo Sany Laber and Crmston de Souza
Experimental Comparison of Shortest Path Approaches for Timetable
Information
Evangelia Pyrga, Frank Schulz, Dorothea Wagner and Christos Zaroliagis
Reach-based Routing: A New Approach to Shortest Path Algorithms Optimized
for Road Networks
Ron Gutman
Lazy Algorithms for Dynamic Closest Pair with Arbitrary Distance Measures
Jean Cardinal and David Eppstein
Approximating the Visible Region of a Point on a Terrain
Boaz Ben-Moshe, Paz Carmi and Matthew J. Katz
A computation framework for handling motion
Leo Guibas, Menelaos Karavelas and Daniel Russel
Engineering a Sorted List Data Structure for 32 Bit Keys
Roman Dementiev, Lutz Kettner, Jens Mehnert and Peter Sanders
Quantcast