ALENEX 2007: New Orleans, Louisiana, USA

• Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
  Improved External Memory BFS Implementation.
  
• Herman J. Haverkort, Laura Toma, Yi Zhuang:
  Computing Visibility on Terrains in External Memory.
  
• Kamesh Madduri, David A. Bader, Jonathan W. Berry, Joseph R. Crobak:
  An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances.
  
• Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, Dorothea Wagner:
  Computing Many-to-Many Shortest Paths Using Highway Hierarchies.
  
• Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
  In Transit to Constant Time Shortest-Path Queries in Road Networks.
  
• Daisuke Okanohara, Kunihiko Sadakane:
  Practical Entropy-Compressed Rank/Select Dictionary.
  
• Peter Sanders, Frederik Transier:
  Intersection in Integer Inverted Indices.
  
• Juha Kärkkäinen, Joong Chae Na:
  Faster Filters for Approximate String Matching.
  
• Shen Pan, Cary Cherng, Kevin Dick, Richard E. Ladner:
  Algorithms to Take Advantage of Hardware Prefetching.
  
• Melih Onus, Andréa W. Richa, Christian Scheideler:
  Linearization: Locally Self-Stabilizing Sorting in Graphs.
  
• Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa:
  Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service.
  
• Yoav Amit, Joseph S. B. Mitchell, Eli Packer:
  Locating Guards for Visibility Coverage of Polygons.
  
• Tommi A. Junttila, Petteri Kaski:
  Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.
  
• Martin Kutz, Pascal Schweitzer:
  ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm.
  
• Markus Behle, Friedrich Eisenbrand:
  0/1 Vertex and Facet Enumeration with BDDs.