Conferences in DBLP

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

1. 
   Experimental Study of Resilient Algorithms and Data Structures. [Citation Graph (, )][DBLP]
   
   
2. 
   Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   Alternative Routes in Road Networks. [Citation Graph (, )][DBLP]
   
   
4. 
   Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks. [Citation Graph (, )][DBLP]
   
   
5. 
   Space-Efficient SHARC-Routing. [Citation Graph (, )][DBLP]
   
   
6. 
   A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. [Citation Graph (, )][DBLP]
   
   
7. 
   Contraction of Timetable Networks with Realistic Transfers. [Citation Graph (, )][DBLP]
   
   
8. 
   Distributed Time-Dependent Contraction Hierarchies. [Citation Graph (, )][DBLP]
   
   
9. 
   Practical Compressed Suffix Trees. [Citation Graph (, )][DBLP]
   
   
10. 
    Maximum Cliques in Protein Structure Comparison. [Citation Graph (, )][DBLP]
    
    
11. 
    Exact Bipartite Crossing Minimization under Tree Constraints. [Citation Graph (, )][DBLP]
    
    
12. 
    Bit-Parallel Search Algorithms for Long Patterns. [Citation Graph (, )][DBLP]
    
    
13. 
    Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. [Citation Graph (, )][DBLP]
    
    
14. 
    Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars. [Citation Graph (, )][DBLP]
    
    
15. 
    Time-Dependent Contraction Hierarchies and Approximation. [Citation Graph (, )][DBLP]
    
    
16. 
    A New Combinational Logic Minimization Technique with Applications to Cryptology. [Citation Graph (, )][DBLP]
    
    
17. 
    Randomized Rounding for Routing and Covering Problems: Experiments and Improvements. [Citation Graph (, )][DBLP]
    
    
18. 
    The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm. [Citation Graph (, )][DBLP]
    
    
19. 
    An Approximate epsilon-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem. [Citation Graph (, )][DBLP]
    
    
20. 
    A Branch-and-Price Algorithm for Multi-mode Resource Leveling. [Citation Graph (, )][DBLP]
    
    
21. 
    Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs. [Citation Graph (, )][DBLP]
    
    
22. 
    Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem. [Citation Graph (, )][DBLP]
    
    
23. 
    Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. [Citation Graph (, )][DBLP]
    
    
24. 
    New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. [Citation Graph (, )][DBLP]
    
    
25. 
    A Metaheuristic for a Two Echelon Location-Routing Problem. [Citation Graph (, )][DBLP]
    
    
26. 
    New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint. [Citation Graph (, )][DBLP]
    
    
27. 
    An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem. [Citation Graph (, )][DBLP]
    
    
28. 
    An Analysis of Heuristics for Vertex Colouring. [Citation Graph (, )][DBLP]
    
    
29. 
    Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm. [Citation Graph (, )][DBLP]
    
    
30. 
    Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. [Citation Graph (, )][DBLP]
    
    
31. 
    Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems. [Citation Graph (, )][DBLP]
    
    
32. 
    Realtime Classification for Encrypted Traffic. [Citation Graph (, )][DBLP]
    
    
33. 
    Data Propagation with Guaranteed Delivery for Mobile Networks. [Citation Graph (, )][DBLP]
    
    
34. 
    Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. [Citation Graph (, )][DBLP]
    
    
35. 
    Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. [Citation Graph (, )][DBLP]
    
    
36. 
    Policy-Based Benchmarking of Weak Heaps and Their Relatives, . [Citation Graph (, )][DBLP]
    
    
37. 
    Modularity-Driven Clustering of Dynamic Graphs. [Citation Graph (, )][DBLP]
    
    
38. 
    Gateway Decompositions for Constrained Reachability Problems. [Citation Graph (, )][DBLP]
    
    
39. 
    Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere. [Citation Graph (, )][DBLP]
    
    
40. 
    Fault Recovery in Wireless Networks: The Geometric Recolouring Approach. [Citation Graph (, )][DBLP]
    
    
41. 
    Geometric Minimum Spanning Trees with GeoFilterKruskal. [Citation Graph (, )][DBLP]
    
    
42. 
    Practical Nearest Neighbor Search in the Plane. [Citation Graph (, )][DBLP]