4. WAE 2000: Saarbrücken, Germany

@proceedings{DBLP:conf/wae/2000,
  editor    = {Stefan N{\"a}her and
               Dorothea Wagner},
  title     = {Algorithm Engineering, 4th International Workshop, WAE 2000,
               Saarbr{\"u}cken, Germany, September 5-8, 2000, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1982},
  year      = {2001},
  isbn      = {3-540-42512-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lecture

• Karsten Weihe:
  On the Differences between ``Practical'' and ``Applied''. 1-10
  Electronic Edition (Springer LINK) BibTeX

Contributed Papers

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