Conferences in DBLP

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

1. Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
   Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:1-16 [Conf]
   
2. Kurt Mehlhorn, Mark Ziegelmann
   CNOP - A Package for Constrained Network Optimization. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:17-31 [Conf]
   
3. Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
   The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:32-59 [Conf]
   
4. Donald F. Towsley
   Network Tomography through End-to-End Measurements. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:60- [Conf]
   
5. Vitus J. Leung, Sandy Irani
   Experimental Results on Statistical Approaches to Page Replacement Policies. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:61-77 [Conf]
   
6. Michael Mitzenmacher, Sean Owen
   Estimating Resemblance of MIDI Documents. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:78-90 [Conf]
   
7. Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro
   Experiments on Adaptive Set Intersections for Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:91-104 [Conf]
   
8. Saurabh Sethia, Martin Held, Joseph S. B. Mitchell
   PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:105-116 [Conf]
   
9. Irene Finocchi, Rossella Petreschi
   Hierarchical Clustering of Trees: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2001, pp:117-131 [Conf]
   
10. Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
    Travel Planning with Self-Made Maps. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:132-144 [Conf]
    
11. Walter Willinger
    New Algorithmic Challenges Arising in Measurement-Driven Networking Research. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:145-146 [Conf]
    
12. Edgar Chávez, Gonzalo Navarro
    A Probabilistic Spell for the Curse of Dimensionality. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:147-160 [Conf]
    
13. Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail
    Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:161-171 [Conf]
    
14. Songrit Maneewongvatana, David M. Mount
    An Empirical Study of a New Approach to Nearest Neighbor Searching. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:172-187 [Conf]
    
15. Anna R. Karlin
    Spectral Analysis for Data Mining. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:188- [Conf]
    
16. Veli Mäkinen
    Trade Off Between Compression and Search Times in Compact Suffix Array. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:189-201 [Conf]
    
17. Clint Hepner, Clifford Stein
    Implementation of a PTAS for Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:202-215 [Conf]
    
18. Funda Ergün, Süleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha
    Biased Skip Lists for Highly Skewed Access Patterns. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:216-230 [Conf]