Abstract is missing.
- Cache Replacement with Memory AllocationShahram Ghandeharizadeh, Sandy Irani, Jenny Lam. 1-9 [doi]
- A Data-Aware FM-indexHongwei Huo, Longgang Chen, Heng Zhao, Jeffrey Scott Vitter, Yakov Nekrich, Qiang Yu. 10-23 [doi]
- k Document RetrievalSimon Gog, Gonzalo Navarro. 24-32 [doi]
- (Semi-)External Algorithms for Graph Partitioning and ClusteringYaroslav Akhremtsev, Peter Sanders, Christian Schulz 0003. 33-43 [doi]
- The 1-2-3-Toolkit for Building Your Own Balls-into-Bins AlgorithmPierre Bertrand, Christoph Lenzen. 44-54 [doi]
- Computing MaxMin Edge Length TriangulationsSándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel. 55-69 [doi]
- Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex CoverTakuya Akiba, Yoichi Iwata. 70-81 [doi]
- Faster Linear-space Orthogonal Range Searching in Arbitrary DimensionsYuzuru Okajima, Kouichi Maruyama. 82-93 [doi]
- Region-based Approximation Algorithms for Visibility between Imprecise LocationsKevin Buchin, Irina Kostitsyna, Maarten Löffler, Rodrigo I. Silveira. 94-103 [doi]
- Engineering Motif Search for Large GraphsAndreas Björklund, Petteri Kaski, Lukasz Kowalik, Juho Lauri. 104-118 [doi]
- Experimental Evaluation of Multi-Round Matrix Multiplication on MapReduceMatteo Ceccarello, Francesco Silvestri. 119-132 [doi]
- Approximating Betweenness Centrality in Large Evolving NetworksElisabetta Bergamini, Henning Meyerhenke, Christian Staudt. 133-146 [doi]
- Analysis and Experimental Evaluation of Time-Dependent Distance OraclesSpyros C. Kontogiannis, George Michalopoulos, Georgia Papastavrou, Andreas Paraskevopoulos, Dorothea Wagner, Christos D. Zaroliagis. 147-158 [doi]
- An I/O-efficient Distance Oracle for Evolving Real-World GraphsDeepak Ajwani, Ulrich Meyer, David Veith. 159-172 [doi]
- 2-Connectivity in Directed Graphs: An Experimental StudyWilliam Di Luigi, Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis. 173-187 [doi]