Conferences in DBLP

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

1. Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
   Improving Linear Programming Approaches for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:1-14 [Conf]
   
2. Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis
   Algorithms and Experiments on Colouring Squares of Planar Graphs. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:15-32 [Conf]
   
3. Vittorio Bilò, Michele Flammini, Roberto Giovannelli
   Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:33-46 [Conf]
   
4. Domenico Cantone, Simone Faro
   Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:47-58 [Conf]
   
5. Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
   An On-Line Algorithm for the Rectangle Packing Problem with Rejection. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:59-69 [Conf]
   
6. François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
   New Lower and Upper Bounds for Graph Treewidth. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:70-80 [Conf]
   
7. Pierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano
   Search Data Structures for Skewed Strings. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:81-96 [Conf]
   
8. Josep Díaz, Jordi Petit, Maria J. Serna
   Evaluation of Basic Protocols for Optical Smart Dust Networks. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:97-106 [Conf]
   
9. Doratha E. Drake, Stefan Hougardy
   Linear Time Local Improvements for Weighted Matchings in Graphs. [Citation Graph (0, 0)][DBLP]
   WEA, 2003, pp:107-119 [Conf]
   
10. Rudolf Fleischer, Gerhard Trippen
    Experimental Studies of Graph Traversal Algorithms. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:120-133 [Conf]
    
11. Karlis Freivalds
    A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:134-147 [Conf]
    
12. Alexander Hall, Hanjo Täubig
    Comparing Push- and Pull-Based Broadcasting. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:148-164 [Conf]
    
13. Martin Hoefer
    Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:165-178 [Conf]
    
14. Víctor M. Jiménez, Andrés Marzal
    A Lazy Version of Eppstein's K Shortest Paths Algorithm. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:179-190 [Conf]
    
15. Martin Kochol
    Linear Algorithm for 3-Coloring of Locally Connected Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:191-194 [Conf]
    
16. Wei-Fu Lu, Wen-Lian Hsu
    A Clustering Algorithm for Interval Graph Test on Noisy Data. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:195-208 [Conf]
    
17. Monaldo Mastrolilli, Leonora Bianchi
    Core Instances for Testing: A Case Study. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:209-221 [Conf]
    
18. Kurt Mehlhorn
    The Reliable Algorithmic Software Challenge RASC. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:222- [Conf]
    
19. Marco Pranzo, Carlo Meloni, Dario Pacciarelli
    A New Class of Greedy Heuristics for Job Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:223-236 [Conf]
    
20. Mitali Singh, Viktor K. Prasanna
    Algorithmic Techniques for Memory Energy Reduction. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:237-252 [Conf]
    
21. Roberto Solis-Oba
    A Framework for Designing Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:253-260 [Conf]
    
22. Dorothea Wagner
    Analysis and Visualization of Social Networks. [Citation Graph (0, 0)][DBLP]
    WEA, 2003, pp:261-266 [Conf]