Conferences in DBLP

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

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