Abstract is missing.
- Improving Linear Programming Approaches for the Steiner Tree ProblemErnst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand. 1-14 [doi]
- Algorithms and Experiments on Colouring Squares of Planar GraphsMaria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis. 15-32 [doi]
- Experimental Analysis of Online Algorithms for the Bicriteria Scheduling ProblemVittorio Bilò, Michele Flammini, Roberto Giovannelli. 33-46 [doi]
- Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching AlgorithmDomenico Cantone, Simone Faro. 47-58 [doi]
- An On-Line Algorithm for the Rectangle Packing Problem with RejectionMassimiliano Caramia, Stefano Giordani, Antonio Iovanella. 59-69 [doi]
- New Lower and Upper Bounds for Graph TreewidthFrançois Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre. 70-80 [doi]
- Search Data Structures for Skewed StringsPierluigi Crescenzi, Roberto Grossi, Giuseppe F. Italiano. 81-96 [doi]
- Evaluation of Basic Protocols for Optical Smart Dust NetworksJosep Díaz, Jordi Petit, Maria J. Serna. 97-106 [doi]
- Linear Time Local Improvements for Weighted Matchings in GraphsDoratha E. Drake, Stefan Hougardy. 107-119 [doi]
- Experimental Studies of Graph Traversal AlgorithmsRudolf Fleischer, Gerhard Trippen. 120-133 [doi]
- A Nondifferentiable Optimization Approach to Ratio-Cut PartitioningKarlis Freivalds. 134-147 [doi]
- Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility LocationMartin Hoefer. 165-178 [doi]
- A Lazy Version of Eppstein s ::::K:::: Shortest Paths AlgorithmVíctor M. Jiménez, Andrés Marzal. 179-190 [doi]
- Linear Algorithm for 3-Coloring of Locally Connected GraphsMartin Kochol. 191-194 [doi]
- A Clustering Algorithm for Interval Graph Test on Noisy DataWei-Fu Lu, Wen-Lian Hsu. 195-208 [doi]
- Core Instances for Testing: A Case StudyMonaldo Mastrolilli, Leonora Bianchi. 209-221 [doi]
- The Reliable Algorithmic Software Challenge RASCKurt Mehlhorn. 222 [doi]
- A New Class of Greedy Heuristics for Job Shop Scheduling ProblemsMarco Pranzo, Carlo Meloni, Dario Pacciarelli. 223-236 [doi]
- Algorithmic Techniques for Memory Energy ReductionMitali Singh, Viktor K. Prasanna. 237-252 [doi]
- A Framework for Designing Approximation Algorithms for Scheduling ProblemsRoberto Solis-Oba. 253-260 [doi]
- Analysis and Visualization of Social NetworksDorothea Wagner. 261-266 [doi]