2. WAE 1998:
Saarbrücken,
Germany
Kurt Mehlhorn (Ed.):
Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbrücken, Germany, August 20-22, 1998, Proceedings.
Max-Planck-Institut für Informatik 1998 
@proceedings{DBLP:conf/wae/1998,
editor = {Kurt Mehlhorn},
title = {Algorithm Engineering, 2nd International Workshop, WAE '92, Saarbr{\"u}cken,
Germany, August 20-22, 1998, Proceedings},
booktitle = {Algorithm Engineering},
publisher = {Max-Planck-Institut f{\"u}r Informatik},
year = {1998},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Karsten Weihe, Thomas Willhalm:
Why CAD Data Repair Requires Discrete Algorithmic Techniques.
1-12
- Thomas Erlebach, Klaus Jansen:
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks.
13-24
- Stefan Nilsson, Matti Tikkanen:
Implementing a Dynamic Compressed Trie.
25-36
- John R. Black, Charles U. Martel, Hongbin Qi:
Graph and Hashing Algorithms for Modern Architectures: Design and Performance.
37-48
- Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sahinalp:
Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression.
49-61
- Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan:
Computing the Width of a Three-Dimensional Point Set: An Experimental Study.
62-73
- Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas:
Implementation and Testing Eavesdropper Protocols Using the DSP Tool.
74-85
- Matthias Müller-Hannemann, Alexander Schwartz:
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.
86-97
- Nadav Eiron, Michael Rodeh, Iris Steinwarts:
Matrix Multiplication: A Case Study of Algorithm Engineering.
98-109
- Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes.
110-120
- John D. Kececioglu, A. Justin Pecqueur:
Computing Maximum-Cardinality Matchings in Sparse General Graphs.
121-132
- Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
A Network Based Approach for Realtime Walkthrough of Massive Models.
133-142
- Torben Hagerup, Peter Sanders, Jesper Larsson Träff:
An Implementation of the Binary Blocking Flow Algorithm.
143-154
- Elena Marchiori, Adri G. Steenbeek:
An Iterated Heuristic Algorithm for the Set Covering Problem.
155-166
- Riko Jacob, Madhav V. Marathe, Kai Nagel:
A Computational Study of Routing Algorithms for Realistic Transportation Networks.
167-178
- Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph:
Hybrid Tree Reconstruction Methods.
179-192
- Naila Rahman, Rajeev Raman:
An Experimental Study of Word-level Parallelism in Some Sorting Algorithms.
193-203
- Steven Skiena:
Who is Interested in Algorithms and why? Lessons from the Stony Brook Algorithms Repository.
204-212
Last update Tue Feb 14 04:12:51 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
