|
Journals in DBLP
Algorithmica 2005, volume: 43, number: 4
- Jianer Chen, Iyad A. Kanj, Ge Xia
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:245-273 [Journal]
- David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
- Jesper Jansson, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung
Rooted Maximum Agreement Supertrees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:293-307 [Journal]
- Mahesh Kallahalla, Peter J. Varman
Optimal Read-Once Parallel Disk Scheduling. [Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:43, n:4, pp:309-343 [Journal]
|