ACM Journal of Experimental Algorithmics, Volume 10

Volume 10, 2005

• Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah:
  Adaptive data structures for IP lookups.
  Electronic Edition (ACM DL) BibTeX
• Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher:
  New heuristic and interactive approaches to 2D rectangular strip packing.
  Electronic Edition (ACM DL) BibTeX
• Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis:
  Geometric containers for efficient shortest-path computation.
  Electronic Edition (ACM DL) BibTeX
• Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar:
  Fast string sorting using order-preserving compression.
  Electronic Edition (ACM DL) BibTeX

• Ranjan Sinha, Justin Zobel:
  Using random sampling to build approximate tries for efficient string sorting.
  Electronic Edition (ACM DL) BibTeX
• Celso C. Ribeiro, Simone L. Martins:
  Preface.
  Electronic Edition (ACM DL) BibTeX
• Evandro C. Bracht, Luis A. A. Meira, Flávio Keidi Miyazawa:
  A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique.
  Electronic Edition (ACM DL) BibTeX
• Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano:
  The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.
  Electronic Edition (ACM DL) BibTeX
• Jingde Du, Stavros G. Kolliopoulos:
  Implementing approximation algorithms for the single-source unsplittable flow problem.
  Electronic Edition (ACM DL) BibTeX
• Amalia Duch, Conrado Martínez:
  Improving the performance of multidimensional search using fingers.
  Electronic Edition (ACM DL) BibTeX
• Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
  Combining speed-up techniques for shortest-path computations.
  Electronic Edition (ACM DL) BibTeX
• Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro:
  Increased bit-parallelism for approximate and multiple string matching.
  Electronic Edition (ACM DL) BibTeX
• Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke:
  In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes.
  Electronic Edition (ACM DL) BibTeX
• Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
  Approximating interval coloring and max-coloring in chordal graphs.
  Electronic Edition (ACM DL) BibTeX
• Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza:
  A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem.
  Electronic Edition (ACM DL) BibTeX