4. WAE 2000:
Saarbrücken, Germany
Stefan Näher, Dorothea Wagner (Eds.):
Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings.
Lecture Notes in Computer Science 1982 Springer 2001, ISBN 3-540-42512-8 
Invited Lecture
- Karsten Weihe:
On the Differences between ``Practical'' and ``Applied''.
1-10
Contributed Papers
- Susanne Albers, Bianca Schröder:
An Experimental Study of Online Scheduling Algorithms.
11-22
- Kurt Mehlhorn, Guido Schäfer:
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures.
23-38
- Stefan Edelkamp, Patrick Stiegeler:
Pushing the Limits in Sequential Sorting.
39-50
- Lars Arge, Jeffrey S. Chase, Jeffrey Scott Vitter, Rajiv Wickremesinghe:
Efficient Sorting Using Registers and Caches.
51-62
- Werner Backes, Susanne Wetzel:
Lattice Basis Reduction with Dynamic Approximation.
63-73
- Javed A. Aslam, Alain Leblanc, Clifford Stein:
Clustering Data without Prior Knowledge.
74-86
- Annegret Liebers, Karsten Weihe:
Recognizing Bundles in Time Table Graphs - A Structural Approach.
87-98
- Ioannis Chatzigiannakis, Sotiris E. Nikoletseas, Paul G. Spirakis:
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.
99-110
- Isabelle Guérin Lassous, Jens Gustedt:
Portable List Ranking: An Experimental Study.
111-122
- Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto:
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.
123-134
- Peter Sanders, Rudolf Fleischer:
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.
135-146
- Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach.
147-158
- Jesper Bojesen, Jyrki Katajainen:
Interchanging Two Segments of an Array in a Hierarchical Memory System.
159-170
- Iddo Hanniel, Dan Halperin:
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.
171-182
- Jan Vahrenhold, Klaus Hinrichs:
Planar Point Location for Large Data Sets: To Seek or Not to Seek.
183-194
- Thomas Erlebach, Klaus Jansen:
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.
195-206
- Guido Proietti:
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.
207-217
- Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.
218-229
- Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
New Algorithms for Examination Timetabling.
230-242
Last update Tue May 21 18:11:55 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
