Abstract is missing.
- Reducing Splaying by Taking Advantage of Working SetsTimo Aho, Tapio Elomaa, Jussi Kujala. 1-13 [doi]
- Engineering Burstsort: Towards Fast In-Place String SortingRanjan Sinha, Anthony Wirth. 14-27 [doi]
- Comparing Integer Data Structures for 32 and 64 Bit KeysNicholas Nash, David Gregg. 28-42 [doi]
- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting ProblemsFrançois Clautiaux, Antoine Jouglet, Aziz Moukrim. 43-54 [doi]
- Layer-Free Upward Crossing MinimizationMarkus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong. 55-68 [doi]
- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay RealizationsKevin M. Lillis, Sriram V. Pemmaraju. 69-86 [doi]
- Computing Branch Decomposition of Large Planar GraphsZhengbing Bian, Qian-Ping Gu. 87-100 [doi]
- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery ProblemMarcelo C. Couto, Cid C. de Souza, Pedro Jussieu de Rezende. 101-113 [doi]
- Computing Multiple Watchman RoutesEli Packer. 114-128 [doi]
- Engineering Parallel In-Place Random Generation of Integer PermutationsJens Gustedt. 129-141 [doi]
- Parallel Partition RevisitedLeonor Frias, Jordi Petit. 142-153 [doi]
- Broadword Implementation of Rank/Select QueriesSebastiano Vigna. 154-168 [doi]
- Efficient Implementations of Heuristics for Routing and Wavelength AssignmentThiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro. 169-180 [doi]
- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion GamesDimitris Kalles, Alexis C. Kaporis, Paul G. Spirakis. 181-193 [doi]
- When to Reap and When to Sow - Lowering Peak Usage with Realistic BatteriesAmotz Bar-Noy, Yi Feng 0002, Matthew P. Johnson, Ou Liu. 194-207 [doi]
- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm DesignDeepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo. 208-219 [doi]
- Fast Local Search for the Maximum Independent Set ProblemDiogo Viera Andrade, Mauricio G. C. Resende, Renato Fonseca F. Werneck. 220-234 [doi]
- Optimal University Course Timetables and the Partial Transversal PolytopeGerald Lach, Marco E. Lübbecke. 235-248 [doi]
- A Basic Toolbox for Constrained Quadratic 0/1 OptimizationChristoph Buchheim, Frauke Liers, Marcus Oswald. 249-262 [doi]
- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to TheoryJens Jägersküpper, Mike Preuss. 263-274 [doi]
- Reconstructing Phylogenetic Networks with One RecombinationErnst Althaus, Rouven Naujoks. 275-288 [doi]
- Exact Algorithms for Cluster Editing: Evaluation and ExperimentsSebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau. 289-302 [doi]
- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra s AlgorithmReinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner. 303-318 [doi]
- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road NetworksRobert Geisberger, Peter Sanders, Dominik Schultes, Daniel Delling. 319-333 [doi]
- Bidirectional A:::*::: Search for Time-Dependent Fast PathsGiacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes. 334-346 [doi]
- Multi-criteria Shortest Paths in Time-Dependent Train NetworksYann Disser, Matthias Müller-Hannemann, Mathias Schnee. 347-361 [doi]