2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX)
The proceedings contain fifteen contributed papers and the abstract of an invited lecture by Madhav Marathe. The contributed papers were selected from a total of 60 submissions based on originality, technical contribution, and relevance. Considerable effort was devoted to the evaluation of the submissions with three reviews or more per paper. It is nonetheless expected that most of the papers in these proceedings will eventually appear in finished form in scientific journals.
Each link below is to a PDF of the paper as it was submitted. Papers are listed in program order. PDF file names represent the Proceedings (ALX and year 07), followed by order in printed version (e.g. 001) and first author's first initial and last name.
3 Improved External Memory BFS Implementations
Deepak Ajwani, Ulrich Meyer and Vitaly Osipov
13 Computing Visibility on Terrains in External Memory
Herman Haverkort, Laura Toma and Yi Zhuang
23 An Experimental Study of A Parallel Shortest Path Algorithm for Solving
Large-Scale Graph Instances
Kamesh Madduri, David A. Bader, Jonathan W. Berry and Joseph R. Crobak
36 Computing Many-to-Many Shortest Paths Using Highway Hierarchies
Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz and
Dorothea Wagner
46 In Transit to Constant Time Shortest-Path Queries in Road Networks
Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders and Dominik
Schultes
60 Practical Entropy-Compressed Rank/Select Dictionary
Daisuke Okanohara and Kunihiko Sadakane
71 Intersection in Integer Inverted Indices
Peter Sanders and Frederik Transier
84 Faster Filters for Approximate String Matching
Juha Karkkainen and Joong Chae Na
91 Algorithms to Take Advantage of Hardware Prefetching
Shen Pan, Cary Cherng, Kevin Dick and Richard E. Ladner
99 Linearization: Locally Self-Stabilizing Sorting in Graphs
Melih Onus, Andrea Richa and Christian Scheideler
109 Maximizing Throughput in Minimum Rounds in an Application-Level Relay
Service
Fred Annexstein, Ken Berman, Svetlana Strunjas and Chad Yoshikawa
120 Locating Guards for Visibility Coverage of Polygons
Yoav Amit, Joseph S. B. Mitchell and Eli Packer
135 Engineering an Efficient Canonical Labeling Tool for Large and Sparse
Graphs
Tommi Junttila and Petteri Kaski
150 ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
Martin Kutz and Pascal Schweitzer
158 0/1 Vertex and Facet Enumeration with BDDs
Markus Behle and Friedrich Eisenbrand
