
Journals in DBLP
J. Algorithms 2000, volume: 34, number: 2
 Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama
Greedily Finding a Dense Subgraph. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:203221 [Journal]
 Monika Rauch Henzinger, Satish Rao, Harold N. Gabow
Computing Vertex Connectivity: New Bounds from Old Techniques. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:222250 [Journal]
 Daniele Frigioni, Alberto MarchettiSpaccamela, Umberto Nanni
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:251281 [Journal]
 Marek Chrobak, John Noga
Competitive Algorithms for Relaxed List Update and Multilevel Caching. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:282308 [Journal]
 James F. Korsh, Paul LaFollette
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:309336 [Journal]
 WunTat Chan, Francis Y. L. Chin
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:337369 [Journal]
 Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
Online Scheduling with Hard Deadlines. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:370389 [Journal]
 Ajai Kapoor, Romeo Rizzi
EdgeColoring Bipartite Graphs. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:34, n:2, pp:390396 [Journal]
