Conferences in DBLP

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

1. Andrew V. Goldberg
   Selecting Problems for Algorithm Evaluation. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:1-11 [Conf]
   
2. William F. McColl
   BSP Algorithms - Write Once, Run Anywhere. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:12-13 [Conf]
   
3. Kurt Mehlhorn
   Ten Years of LEDA Some Thoughts (Abstract). [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:14- [Conf]
   
4. Víctor M. Jiménez, Andrés Marzal
   Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:15-29 [Conf]
   
5. Robert Giegerich, Stefan Kurtz, Jens Stoye
   Efficient Implementation of Lazy Suffix Trees. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:30-42 [Conf]
   
6. Shlomit Dascal, Uzi Vishkin
   Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:43-59 [Conf]
   
7. Renato Fonseca F. Werneck, João C. Setubal, Arlindo Flávio da Conceição
   Finding Minimum Congestion Spanning Trees. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:60-71 [Conf]
   
8. Dimitris J. Kavvadias, Elias C. Stavropoulos
   Evaluation of an Algorithm for the Transversal Hypergraph Problem. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:72-84 [Conf]
   
9. Fred Glover, Gregory Gutin, Anders Yeo, Alexey Zverovich
   Construction Heuristics and Domination Analysis for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
   Algorithm Engineering, 1999, pp:85-94 [Conf]
   
10. Kostas P. Hatzis, George P. Pentaris, Paul G. Spirakis, Basil Tampakas
    Counting in Mobile Networks: Theory and Experimentation. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:95-109 [Conf]
    
11. Frank Schulz, Dorothea Wagner, Karsten Weihe
    Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:110-123 [Conf]
    
12. Panagiota Fatourou, Paul G. Spirakis, Panagiotis Zarafidis, Anna Zoura
    Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:124-138 [Conf]
    
13. Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, Chaim Linhart
    On-Line Zone Construction in Arrangements of Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:139-153 [Conf]
    
14. Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan
    The Design and Implementation of Planar Maps in CGAL. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:154-168 [Conf]
    
15. Jochen Comes, Mark Ziegelmann
    An Easy to Use Implementation of Linear Perturbations within CGAL. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:169-182 [Conf]
    
16. Naila Rahman, Rajeev Raman
    Analysing Cache Effects in Distribution Sorting. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:183-197 [Conf]
    
17. Gonzalo Navarro, Mathieu Raffinot
    Fast Regular Expression Search. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:198-212 [Conf]
    
18. Maureen Korda, Rajeev Raman
    An Experimental Evaluation of Hybrid Data Structures for Searching. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:214-228 [Conf]
    
19. Andreas Crauser, Kurt Mehlhorn
    LEDA-SM Extending LEDA to Secondary Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:229-243 [Conf]
    
20. Michael L. Fredman
    A Priority Queue Transform. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:244-258 [Conf]
    
21. Athanasios Bouganis, Ioannis Caragiannis, Christos Kaklamanis
    Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:259-271 [Conf]
    
22. Daniel H. Huson, Kelly Ann Smith, Tandy Warnow
    Estimating Large Distances in Phylogenetic Reconstruction. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:272-286 [Conf]
    
23. Sabine Hanke
    The Performance of Concurrent Red-Black Tree Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:287-301 [Conf]
    
24. Jesper Bojesen, Jyrki Katajainen, Maz Spork
    Performance Engineering Case Study: Heap Construction. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:302-316 [Conf]
    
25. Massimiliano Caramia, Paolo Dell'Olmo
    A Fast and Simple Local Search for Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:317-330 [Conf]
    
26. Nicolas Boghossian, Oliver Kohlbacher, Hans-Peter Lenhof
    BALL: Biochemical Algorithms Library. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:331-345 [Conf]
    
27. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
    An Experimental Study of Priority Queues in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:346-360 [Conf]