Conferences in DBLP

Workshop on Algorithm Engineering (WAE) (wae)
1998 (conf/wae/1998)

1. Karsten Weihe, Thomas Willhalm
   Why CAD Data Repair Requires Discrete Algorithmic Techniques. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:1-12 [Conf]
   
2. Thomas Erlebach, Klaus Jansen
   Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:13-24 [Conf]
   
3. Stefan Nilsson, Matti Tikkanen
   Implementing a Dynamic Compressed Trie. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:25-36 [Conf]
   
4. John R. Black, Charles U. Martel, Hongbin Qi
   Graph and Hashing Algorithms for Modern Architectures: Design and Performance. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:37-48 [Conf]
   
5. Yossi Matias, Nasir Rajpoot, Süleyman Cenk Sahinalp
   Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:49-61 [Conf]
   
6. Jörg Schwerdt, Michiel H. M. Smid, Jayanth Majhi, Ravi Janardan
   Computing the Width of a Three-Dimensional Point Set: An Experimental Study. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:62-73 [Conf]
   
7. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Vasilis T. Tampakas
   Implementation and Testing Eavesdropper Protocols Using the DSP Tool. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:74-85 [Conf]
   
8. Matthias Müller-Hannemann, Alexander Schwartz
   Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:86-97 [Conf]
   
9. Nadav Eiron, Michael Rodeh, Iris Steinwarts
   Matrix Multiplication: A Case Study of Algorithm Engineering. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1998, pp:98-109 [Conf]
   
10. Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels
    Guarding Scenes against Invasive Hypercubes. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:110-120 [Conf]
    
11. John D. Kececioglu, A. Justin Pecqueur
    Computing Maximum-Cardinality Matchings in Sparse General Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:121-132 [Conf]
    
12. Matthias Fischer, Tamás Lukovszki, Martin Ziegler
    A Network Based Approach for Realtime Walkthrough of Massive Models. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:133-142 [Conf]
    
13. Torben Hagerup, Peter Sanders, Jesper Larsson Träff
    An Implementation of the Binary Blocking Flow Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:143-154 [Conf]
    
14. Elena Marchiori, Adri G. Steenbeek
    An Iterated Heuristic Algorithm for the Set Covering Problem. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:155-166 [Conf]
    
15. Riko Jacob, Madhav V. Marathe, Kai Nagel
    A Computational Study of Routing Algorithms for Realistic Transportation Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:167-178 [Conf]
    
16. Daniel H. Huson, Scott Nettles, Kenneth Rice, Tandy Warnow, Shibu Yooseph
    Hybrid Tree Reconstruction Methods. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:179-192 [Conf]
    
17. Naila Rahman, Rajeev Raman
    An Experimental Study of Word-level Parallelism in Some Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:193-203 [Conf]
    
18. Steven Skiena
    Who is Interested in Algorithms and why? Lessons from the Stony Brook Algorithms Repository. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1998, pp:204-212 [Conf]