Front matter
1-10
On the Differences between “Practical” and “Applied”
Karsten Weihe
11-22
An Experimental Study of Online Scheduling Algorithms
Susanne Albers and Bianca Schröder
23-38
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
Kurt Mehlhorn and Guido Schäfer
39-50
Pushing the Limits in Sequential Sorting
Stefan Edelkamp and Patrick Stiegeler
51-62
Efficient Sorting Using Registers and Caches
Lars Arge, Jeff Chase, Jeffrey S. Vitter and Rajiv Wickremesinghe
63-73
Lattice Basis Reduction with Dynamic Approximation
Werner Backes and Susanne Wetzel
74-86
Clustering Data without Prior Knowledge
Javed Aslam, Alain Leblanc and Clifford Stein
87-98
Recognizing Bundles in Time Table Graphs - A Structural Approach
Annegret Liebers and Karsten Weihe
99-110
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks
I. Chatzigiannakis, S. Nikoletseas and P. Spirakis
111-122
Portable List Ranking: An Experimental Study
Isabelle Guérin Lassous and Jens Gustedt
123-134
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe and Jun Umemoto
135-146
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
Peter Sanders and Rudolf Fleischer
147-158
Visualizing Algorithms Over the Web with the Publication-Driven Approach
Camil Demetrescu, Irene Finocchi and Giuseppe Liotta
159-170
Interchanging Tw Segments of an Array in a Hierarchical Memory System
Jesper Bojesen and Jyrki Katajainen
171-182
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Iddo Hanniel and Dan Halperin
183-194
Planar Point Location for Large Data Sets: To Seek or Not to Seek
Jan Vahrenhold and Klaus H. Hinrichs
195-206
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
Thomas Erlebach and Klaus Jansen
207-217
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
Guido Proietti
218-229
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela and Umberto Nanni
230-241
New Algorithms for Examination Timetabling
Massimiliano Caramia, Paolo Dell’Olmo and Giuseppe F. Italiano
Back matter