Conferences in DBLP

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

1. 
   Compressed Inverted Indexes for In-Memory Search Engines. [Citation Graph (, )][DBLP]
   
   
2. 
   SHARC: Fast and Robust Unidirectional Routing. [Citation Graph (, )][DBLP]
   
   
3. 
   Obtaining Optimal k-Cardinality Trees Fast. [Citation Graph (, )][DBLP]
   
   
4. 
   Implementing Partial Persistence in Object-Oriented Languages. [Citation Graph (, )][DBLP]
   
   
5. 
   Comparing Online Learning Algorithms to Stochastic Approaches for the Multi-Period Newsvendor Problem. [Citation Graph (, )][DBLP]
   
   
6. 
   Routing in Graphs with Applications to Material Flow Problems. [Citation Graph (, )][DBLP]
   
   
7. 
   How much Geometry it takes to Reconstruct a 2-Manifold in R3. [Citation Graph (, )][DBLP]
   
   
8. 
   Geometric Algorithms for Optimal Airspace Design and Air Traffic Controller Workload Balancing. [Citation Graph (, )][DBLP]
   
   
9. 
   Better Approximation of Betweenness Centrality. [Citation Graph (, )][DBLP]
   
   
10. 
    Decoupling the CGAL 3D Triangulations from the Underlying Space. [Citation Graph (, )][DBLP]
    
    
11. 
    Consensus Clustering Algorithms: Comparison and Refinement. [Citation Graph (, )][DBLP]
    
    
12. 
    Shortest Path Feasibility Algorithms: An Experimental Evaluation. [Citation Graph (, )][DBLP]
    
    
13. 
    Ranking Tournaments: Local Search and a New Algorithm. [Citation Graph (, )][DBLP]
    
    
14. 
    An Experimental Study of Recent Hotlink Assignment Algorithms. [Citation Graph (, )][DBLP]
    
    
15. 
    Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. [Citation Graph (, )][DBLP]