Abstract is missing.
- On the Differences between Practical and Applied Karsten Weihe. 1-10 [doi]
- An Experimental Study of Online Scheduling AlgorithmsSusanne Albers, Bianca Schröder. 11-22 [doi]
- Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data StructuresKurt Mehlhorn, Guido Schäfer. 23-38 [doi]
- Pushing the Limits in Sequential SortingStefan Edelkamp, Patrick Stiegeler. 39-50 [doi]
- Efficient Sorting Using Registers and CachesLars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe. 51-62 [doi]
- Lattice Basis Reduction with Dynamic ApproximationWerner Backes, Susanne Wetzel. 63-73 [doi]
- Clustering Data without Prior KnowledgeJaved A. Aslam, Alain Leblanc, Clifford Stein. 74-86 [doi]
- Recognizing Bundles in Time Table Graphs - A Structural ApproachAnnegret Liebers, Karsten Weihe. 87-98 [doi]
- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile NetworksIoannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis. 99-110 [doi]
- Portable List Ranking: An Experimental StudyIsabelle Guérin Lassous, Jens Gustedt. 111-122 [doi]
- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVMKazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto. 123-134 [doi]
- Asymptotic Complexity from Experiments? A Case Study for Randomized AlgorithmsPeter Sanders, Rudolf Fleischer. 135-146 [doi]
- Visualizing Algorithms over the Web with the Publication-Driven ApproachCamil Demetrescu, Irene Finocchi, Giuseppe Liotta. 147-158 [doi]
- Interchanging Two Segments of an Array in a Hierarchical Memory SystemJesper Bojesen, Jyrki Katajainen. 159-170 [doi]
- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric CurvesIddo Hanniel, Dan Halperin. 171-182 [doi]
- Planar Point Location for Large Data Sets: To Seek or Not to SeekJan Vahrenhold, Klaus Hinrichs. 183-194 [doi]
- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected TreesThomas Erlebach, Klaus Jansen. 195-206 [doi]
- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths TreesGuido Proietti. 207-217 [doi]
- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental StudyCamil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni. 218-229 [doi]
- New Algorithms for Examination TimetablingMassimiliano Caramia, Paolo Dell Olmo, Giuseppe F. Italiano. 230-242 [doi]