Journals in DBLP

J. Algorithms
1984, volume: 5, number: 2

1. David A. Plaisted
   Heuristic Matching for Graphs Satisfying the Triangle Inequality. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:163-179 [Journal]
   
2. Peter J. Weinberger
   Finding the Number of Factors of a Polynomial. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:180-186 [Journal]
   
3. M. Boshernitzan, Aviezri S. Fraenkel
   A Linear Algorithm for Nonhomogeneous Spectra of Numbers. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:187-198 [Journal]
   
4. Eljas Soisalon-Soininen, Derick Wood
   Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles. [Citation Graph (2, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:199-214 [Journal]
   
5. Richard P. Anstee, Martin Farber
   Characterizations of Totally Balanced Matrices. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:215-230 [Journal]
   
6. Christos H. Papadimitriou, Umesh V. Vazirani
   On Two Geometric Problems Related to the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:231-246 [Journal]
   
7. Nicholas C. Wormald
   Generating Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:247-280 [Journal]
   
8. Ichiro Semba
   An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:281-283 [Journal]
   
9. David S. Johnson
   The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1984, v:5, n:2, pp:284-299 [Journal]