Journals in DBLP

J. Algorithms
1983, volume: 4, number: 2

1. Ronald I. Becker, Yehoshua Perl
   Shifting Algorithms for Tree Partitioning with General Weighting Functions. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:101-120 [Journal]
   
2. Binay K. Bhattacharya, Godfried T. Toussaint
   Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:121-136 [Journal]
   
3. Ephraim Feig
   Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:137-149 [Journal]
   
4. Alan D. Kalvin, Yaakov L. Varol
   On the Generation of All Topological Sortings. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:150-162 [Journal]
   
5. Gregory Butler
   Computing Normalizers in Permutation Groups. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:163-175 [Journal]
   
6. Leonidas J. Guibas
   Problems. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:176-188 [Journal]
   
7. David S. Johnson
   The NP-Completeness Column: An Ongoing Guide. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1983, v:4, n:2, pp:189-203 [Journal]