
Journals in DBLP
J. Algorithms 1999, volume: 33, number: 2
 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:187203 [Journal]
 MingDeh 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:204228 [Journal]
 Mikkel Thorup
Decremental Dynamic Connectivity. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:2, pp:229243 [Journal]
 Greg N. Frederickson, Roberto SolisOba
Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:2, pp:244266 [Journal]
 Ron Shamir, Dekel Tsur
Faster Subtree Isomorphism. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:2, pp:267280 [Journal]
 Petrisor Panaite, Andrzej Pelc
Exploring Unknown Undirected Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1999, v:33, n:2, pp:281295 [Journal]
 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:296318 [Journal]
