The ACM Journal of Experimental Algorithmics

Section 1: Regular Articles

Article 1.1: Adaptive Data Structures for IP Lookups, by Ioannis Ioannidis, Ananth Grama, and Mikhail Atallah.
Related Resources:
• A Unix Tar file containing code described in the article.

Article 1.2: New Heuristic and Interactive Approaches to 2D Retangular Strip Packing, by N. Lesh, J. Marks, A. McMahon, and M. Mitzenmacher.


Article 1.3: Geometric Containers for Efficient Shortest Path Computation by Dorothea Wagner, Thomas Willhalm, and Christos Zaroliagis.


Article 1.4: Fast String Sorting using Order Preserving Compression by Alejandro Lopez-Ortiz, Mahdi Mirzazadeh, Mohammad Ali Safari, and Hossein Sheikhattar

Section 2: Selected Papers from WEA'04

Selected papers from the III Workshop on Efficient and Experimental Algorithms held in Rio di Janiero, May 2004. Guest co-editors Celso Ribeiro and Simone Martins.

Article 2.1: Preface, by Celso C. Ribeiro and Simone L. Martins.


Article 2.2: The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation, by Cid C. de Sourza, Andre M. Lima, Guido Araujo, and Nahri B. Moreano.


Article 2.3: Implementing approximation algorithms for the single-source unsplittable flow problem, by Jingde Du and Stavros G. Kolliopoulos.


Article 2.4: Improving the performance of multidimensioal search using fingers, by Amalia Duch and Conrado Martinez.


Article 2.5: Combining speed-up techniques for shortest-path computations, by Martin Holzer, Frank Schulz, Dorothea Wagner, and Thomas Willhalm.


Article 2.6: Increased bit-parallelism for approximate and multiple string matching, by Heikki Hyrrö, Kimmo Fredriksson, and Gonzalo Navarro.


Article 2.7: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes, by Nikola S. Nikolov, Alexandre Tarassov, and Jürgen Branke.


Article 2.8: Approximating interval coloring and max-coloring in chordal graphs, by Sriram V. Pemmaraju, Sriram Penumatcha, and Rajiv Raman.


Article 2.9: A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem, by Haroldo G. Santos, Luiz S. Ochi, and Marcone J. F. Souza.


Article 2.10: Using random sampling to build approximate tries for efficient string sorting, by Ranjan Sinha and Justin Zobel.


Article 2.11: A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique, by Evandro C. Bracht, Luis A. A. Meira, and F. K. Miyazawa.