Abstract is missing.
- Efficient algorithms for dualizing large-scale hypergraphsKeisuke Murakami, Takeaki Uno. 1-13 [doi]
- A Min-Edge Cost Flow Framework for Capacitated Covering ProblemsJessica Chang, Samir Khuller. 14-25 [doi]
- Short and Simple Cycle Separators in Planar GraphsEli Fox-Epstein, Shay Mozes, Phitchaya Mangpo Phothilimthana, Christian Sommer. 26-40 [doi]
- Polynomial-time construction of contraction hierarchies for multi-criteria objectivesStefan Funke, Sabine Storandt. 41-54 [doi]
- Engineering Java 7's Dual Pivot Quicksort Using MaLiJanSebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube. 55-69 [doi]
- 3D kinetic alpha complexes and their implementationMichael Kerber, Herbert Edelsbrunner. 70-77 [doi]
- Computational topology and normal surfaces: Theoretical and experimental complexity boundsBenjamin A. Burton, João Paixão, Jonathan Spreer. 78-87 [doi]
- Inducing Suffix and Lcp Arrays in External MemoryTimo Bingmann, Johannes Fischer, Vitaly Osipov. 88-102 [doi]
- Lempel-Ziv factorization: Simple, fast, practicalDominik Kempa, Simon J. Puglisi. 103-112 [doi]
- Fast Packed String Matching for Short PatternsSimone Faro, M. Oguzhan Külekci. 113-121 [doi]
- On parallelizing matrix multiplication by the column-row methodAndrea Campagna, Konstantin Kutzkov, Rasmus Pagh. 122-132 [doi]
- Robust gossip-based aggregation: A practical point of viewGerhard Niederbrucker, Wilfried N. Gansterer. 133-147 [doi]
- The cost of address translationTomasz Jurkiewicz, Kurt Mehlhorn. 148-162 [doi]
- On Unifying the Space of ℓ0-Sampling AlgorithmsGraham Cormode, Donatella Firmani. 163-172 [doi]
- Practical Batch-Updatable External Hashing with SortingHyeontaek Lim, David G. Andersen, Michael Kaminsky. 173-182 [doi]