ALENEX 2008: San Francisco, California, USA

• Frederik Transier, Peter Sanders:
  Compressed Inverted Indexes for In-Memory Search Engines. 3-12
  
• Reinhard Bauer, Daniel Delling:
  SHARC: Fast and Robust Unidirectional Routing. 13-26
  
• Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
  Obtaining Optimal k-Cardinality Trees Fast. 27-36
  
• Frédéric Pluquet, Stefan Langerman, Antoine Marot, Roel Wuyts:
  Implementing Partial Persistence in Object-Oriented Languages. 37-48
  
• Shawn O'Neil, Amitabh Chaudhary:
  Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem. 49-63
  
• Rolf H. Möhring:
  Routing in Graphs with Applications to Material Flow Problems. 64-64
  
• Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
  How much Geometry it takes to Reconstruct a 2-Manifold in R3. 65-74
  
• Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani:
  Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. 75-89
  
• Robert Geisberger, Peter Sanders, Dominik Schultes:
  Better Approximation of Betweenness Centrality. 90-100
  
• Manuel Caroli, Nico Kruithof, Monique Teillaud:
  Decoupling the CGAL 3D Triangulations from the Underlying Space. 101-108
  
• Andrey Goder, Vladimir Filkov:
  Consensus Clustering Algorithms: Comparison and Refinement. 109-117
  
• Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
  Shortest Path Feasibility Algorithms: An Experimental Evaluation. 118-132
  
• Tom Coleman, Anthony Wirth:
  Ranking Tournaments: Local Search and a New Algorithm. 133-141
  
• Tobias Jacobs:
  An Experimental Study of Recent Hotlink Assignment Algorithms. 142-151
  
• Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake:
  Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. 152-165