2. WEA 2003: Ascona, Switzerland

@proceedings{DBLP:conf/wea/2003,
  editor    = {Klaus Jansen and
               Marian Margraf and
               Monaldo Mastrolilli and
               Jos{\'e} D. P. Rolim},
  title     = {Experimental and Efficient Algorithms, Second International Workshop,
               WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings},
  booktitle = {WEA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2647},
  year      = {2003},
  isbn      = {3-540-40205-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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