Conferences in DBLP

Workshop on Experimental and Efficient Algorithms (wea)
2008 (conf/wea/2008)

1. 
   Reducing Splaying by Taking Advantage of Working Sets. [Citation Graph (, )][DBLP]
   
   
2. 
   Engineering Burstsort: Towards Fast In-Place String Sorting. [Citation Graph (, )][DBLP]
   
   
3. 
   Comparing Integer Data Structures for 32 and 64 Bit Keys. [Citation Graph (, )][DBLP]
   
   
4. 
   A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems. [Citation Graph (, )][DBLP]
   
   
5. 
   Layer-Free Upward Crossing Minimization. [Citation Graph (, )][DBLP]
   
   
6. 
   On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. [Citation Graph (, )][DBLP]
   
   
7. 
   Computing Branch Decomposition of Large Planar Graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem. [Citation Graph (, )][DBLP]
   
   
9. 
   Computing Multiple Watchman Routes. [Citation Graph (, )][DBLP]
   
   
10. 
    Engineering Parallel In-Place Random Generation of Integer Permutations. [Citation Graph (, )][DBLP]
    
    
11. 
    Parallel Partition Revisited. [Citation Graph (, )][DBLP]
    
    
12. 
    Broadword Implementation of Rank/Select Queries. [Citation Graph (, )][DBLP]
    
    
13. 
    Efficient Implementations of Heuristics for Routing and Wavelength Assignment. [Citation Graph (, )][DBLP]
    
    
14. 
    Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games. [Citation Graph (, )][DBLP]
    
    
15. 
    When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries. [Citation Graph (, )][DBLP]
    
    
16. 
    Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. [Citation Graph (, )][DBLP]
    
    
17. 
    Fast Local Search for the Maximum Independent Set Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Optimal University Course Timetables and the Partial Transversal Polytope. [Citation Graph (, )][DBLP]
    
    
19. 
    A Basic Toolbox for Constrained Quadratic 0/1 Optimization. [Citation Graph (, )][DBLP]
    
    
20. 
    Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory. [Citation Graph (, )][DBLP]
    
    
21. 
    Reconstructing Phylogenetic Networks with One Recombination. [Citation Graph (, )][DBLP]
    
    
22. 
    Exact Algorithms for Cluster Editing: Evaluation and Experiments. [Citation Graph (, )][DBLP]
    
    
23. 
    Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. [Citation Graph (, )][DBLP]
    
    
24. 
    Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. [Citation Graph (, )][DBLP]
    
    
25. 
    Bidirectional A^* Search for Time-Dependent Fast Paths. [Citation Graph (, )][DBLP]
    
    
26. 
    Multi-criteria Shortest Paths in Time-Dependent Train Networks. [Citation Graph (, )][DBLP]