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