Conferences in DBLP

Algorithm Engineering and Experimentation (ALENEX) (alenex)
1999 (conf/alenex/1999)

1. Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber
   Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:1-17 [Conf]
   
2. Matthias Müller-Hannemann, Alexander Schwartz
   Implementing Weighted b-Matching Algorithms: Insights from a Computational Study. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:18-36 [Conf]
   
3. David R. Helman, Joseph JáJá
   Designing Practical Efficient Algorithms for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:37-56 [Conf]
   
4. Janet M. Six, Ioannis G. Tollis
   Circular Drawings of Biconnected Graphs. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:57-73 [Conf]
   
5. Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
   Heuristics and Experimental Design for Bigraph Crossing Number Minimization. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:74-93 [Conf]
   
6. David M. Mount, Fan-Tao Pu
   Binary Space Partitions in Plücker Space. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:94-113 [Conf]
   
7. Robert J. Walker, Jack Snoeyink
   Practical Point-in-Polygon Tests Using CSG Representations of Polygons. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:114-123 [Conf]
   
8. Michael T. Goodrich, Mark Handy, Benoît Hudson, Roberto Tamassia
   Accessing the Internal Organization of Data Structures in the JDSL Library. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:124-139 [Conf]
   
9. Maurizio Pizzonia, Giuseppe Di Battista
   Object-Oriented Design of Graph Oriented Data Structures. [Citation Graph (0, 0)][DBLP]
   ALENEX, 1999, pp:140-155 [Conf]
   
10. Stefan Schirra
    A Case Study on the Cost of Geometric Computing. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:156-176 [Conf]
    
11. Andrew E. Caldwell, Andrew B. Kahng, Igor L. Markov
    Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:177-193 [Conf]
    
12. S. Cwilich, M. Deng, D. F. Lynch, S. J. Philips, Jeffery Westbrook
    Algorithms for Restoration Planning in a Telecommunications Network. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:194-209 [Conf]
    
13. Tetsuo Shibuya
    Computing the n × m Shortest Paths Efficently. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:210-225 [Conf]
    
14. Gregory L. Heileman, Carlos E. Pizano, Chaouki T. Abdallah
    Image Watermarking for Copyright Protection. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:226-245 [Conf]
    
15. János Csirik, David S. Johnson, Claire Kenyon, Peter W. Shor, Richard R. Weber
    A Self Organizing Bin Packing Heuristic. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:246-265 [Conf]
    
16. Matthew S. Levine
    Finding the Right Cutting Planes for the TSP. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:266-281 [Conf]
    
17. Martin Zachariasen, Pawel Winter
    Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:282-295 [Conf]
    
18. Anurag Acharya, Huican Zhu, Kai Shen
    Adaptive Algorithms for Cache-Efficient Trie Search. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:296-311 [Conf]
    
19. Peter Sanders
    Fast Priority Queues for Cached Memory. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:312-327 [Conf]
    
20. Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
    Efficient Bulk Operations on Dynamic R-trees. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:328-348 [Conf]