Journals in DBLP

J. Algorithms
2000, volume: 37, number: 2

1. Kaihong Xu
   The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:237-246 [Journal]
   
2. Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
   Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:247-266 [Journal]
   
3. Kevin Cattell, Frank Ruskey, Joe Sawada, Micaela Serra, C. Robert Miers
   Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2). [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:267-282 [Journal]
   
4. Yiannis S. Boutalis, Constantin Papaodysseus, E. Koukoutsis
   A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:283-308 [Journal]
   
5. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
   Text Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:309-325 [Journal]
   
6. Jørgen Bang-Jensen, Tibor Jordán
   Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:326-343 [Journal]
   
7. Sorana Froda
   On Assessing the Performance of Randomized Algorithms. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:344-362 [Journal]
   
8. Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
   Box-Rectangular Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:363-398 [Journal]
   
9. Michael T. Goodrich, Christopher G. Wagner
   A Framework for Drawing Planar Graphs with Curves and Polylines. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 2000, v:37, n:2, pp:399-421 [Journal]
   
10. Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai
    Sum Multicoloring of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:422-450 [Journal]
    
11. Adam Smith, Subhash Suri
    Rectangular Tiling in Multidimensional Arrays. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:451-467 [Journal]
    
12. Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir
    The Las-Vegas Processor Identity Problem (How and When to Be Unique). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:468-494 [Journal]
    
13. David Pokrass Jacobs, Robert E. Jamison
    Complexity of Recognizing Equal Unions in Families of Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:495-504 [Journal]
    
14. Celina M. Herrera de Figueiredo, Sulamita Klein, Yoshiharu Kohayakawa, Bruce A. Reed
    Finding Skew Partitions Efficiently. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:505-521 [Journal]
    
15. Sebastian Böcker, David Bryant, Andreas W. M. Dress, Mike A. Steel
    Algorithmic Aspects of Tree Amalgamation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:522-537 [Journal]
    
16. Subhas C. Nandy, Bhargab B. Bhattacharya, Antonio Hernández-Barrera
    Safety Zone Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:538-569 [Journal]
    
17. David Eppstein
    Incremental and Decremental Maintenance of Planar Width. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:570-577 [Journal]