Journals in DBLP

J. Algorithms
1999, volume: 33, number: 2

1. Paul Pritchard
   On Computing the Subset Graph of a Collection of Sets. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:187-203 [Journal]
   
2. Ming-Deh A. Huang, Ashwin J. Rao
   Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:204-228 [Journal]
   
3. Mikkel Thorup
   Decremental Dynamic Connectivity. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:229-243 [Journal]
   
4. Greg N. Frederickson, Roberto Solis-Oba
   Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:244-266 [Journal]
   
5. Ron Shamir, Dekel Tsur
   Faster Subtree Isomorphism. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:267-280 [Journal]
   
6. Petrisor Panaite, Andrzej Pelc
   Exploring Unknown Undirected Graphs. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:281-295 [Journal]
   
7. Dimitris Bertsimas, David Gamarnik
   Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing. [Citation Graph (0, 0)][DBLP]
   J. Algorithms, 1999, v:33, n:2, pp:296-318 [Journal]