Journals in DBLP

ACM Journal of Experimental Algorithms
2005, volume: 10, number:

1. 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. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
2. Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher
   New heuristic and interactive approaches to 2D rectangular strip packing. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
3. Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah
   Adaptive data structures for IP lookups. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
4. Amalia Duch, Conrado Martínez
   Improving the performance of multidimensional search using fingers. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
5. Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
   Increased bit-parallelism for approximate and multiple string matching. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
6. Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman
   Approximating interval coloring and max-coloring in chordal graphs. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
7. Haroldo G. Santos, Luiz S. Ochi, Marcone J. F. Souza
   A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
8. Celso C. Ribeiro, Simone L. Martins
   Preface. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
9. Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano
   The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. [Citation Graph (0, 0)][DBLP]
   ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
   
10. Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke
    In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
    
11. Jingde Du, Stavros G. Kolliopoulos
    Implementing approximation algorithms for the single-source unsplittable flow problem. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
    
12. Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm
    Combining speed-up techniques for shortest-path computations. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
    
13. Ranjan Sinha, Justin Zobel
    Using random sampling to build approximate tries for efficient string sorting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
    
14. Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
    Geometric containers for efficient shortest-path computation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]