ACM Journal of Experimental Algorithmics, Volume 10

Volume 10, 2005

Regular Articles

- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/IoannidisGA05
- ask others
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: Adaptive data structures for IP lookups.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/LeshMMM05
- ask others
Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher: New heuristic and interactive approaches to 2D rectangular strip packing.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/WagnerWZ05
- ask others
Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis: Geometric containers for efficient shortest-path computation.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/Lopez-OrtizMSS05
- ask others
Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar: Fast string sorting using order-preserving compression.

WEA 2004

- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/SinhaZ05
- ask others
Ranjan Sinha, Justin Zobel: Using random sampling to build approximate tries for efficient string sorting.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/RibeiroM05
- ask others
Celso C. Ribeiro, Simone L. Martins: Preface.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/BrachtMM05
- ask others
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.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/SouzaLAM05
- ask others
Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano: The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/DuK05
- ask others
Jingde Du, Stavros G. Kolliopoulos: Implementing approximation algorithms for the single-source unsplittable flow problem.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/DuchM05
- ask others
Amalia Duch, Conrado Martínez: Improving the performance of multidimensional search using fingers.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/HolzerSWW05
- ask others
Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm: Combining speed-up techniques for shortest-path computations.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/HyyroFN05
- ask others
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro: Increased bit-parallelism for approximate and multiple string matching.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/NikolovTB05
- ask others
Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke: In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/PemmarajuPR05
- ask others
Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman: Approximating interval coloring and max-coloring in chordal graphs.
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jea/SantosOS05
- ask others
Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza: A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem.