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