|
|
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:203-221 [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:222-250 [Journal]
- Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2000, v:34, n:2, pp:251-281 [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:282-308 [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:309-336 [Journal]
- Wun-Tat 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:337-369 [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:370-389 [Journal]
- Ajai Kapoor, Romeo Rizzi
Edge-Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2000, v:34, n:2, pp:390-396 [Journal]
|
