Abstract is missing.
- Engineering a Lightweight and Efficient Local Search SAT SolverAdrian Balint, Uwe Schöning. 1-18 [doi]
- Route Planning in Transportation NetworksHannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck. 19-80 [doi]
- Theoretical Analysis of the k-Means Algorithm - A SurveyJohannes Blömer, Christiane Lammersen, Melanie Schmidt 0001, Christian Sohler. 81-116 [doi]
- Recent Advances in Graph PartitioningAydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz 0003. 117-158 [doi]
- How to Generate Randomized Roundings with Dependencies and How to Derandomize ThemBenjamin Doerr, Magnus Wahlström. 159-184 [doi]
- External-Memory State Space SearchStefan Edelkamp. 185-225 [doi]
- Algorithm Engineering Aspects of Real-Time Rendering AlgorithmsMatthias Fischer 0001, Claudius Jähn, Friedhelm Meyer auf der Heide, Ralf Petring. 226-244 [doi]
- Algorithm Engineering in Robust OptimizationMarc Goerigk, Anita Schöbel. 245-279 [doi]
- Clustering Evolving NetworksTanja Hartmann, Andrea Kappes, Dorothea Wagner. 280-329 [doi]
- Integrating Sequencing and Scheduling: A Generic Approach with Two Exemplary Industrial ApplicationsWiebke Höhn, Rolf H. Möhring. 330-351 [doi]
- Engineering a Bipartite Matching Algorithm in the Semi-Streaming ModelLasse Kliemann. 352-378 [doi]
- Engineering Art GalleriesPedro J. de Rezende, Cid C. de Souza, Stephan Friedrichs, Michael Hemmer, Alexander Kröller, Davi C. Tozoni. 379-417 [doi]