|
Journals in DBLP
- Refael Hassin, Shlomi Rubinstein
Approximation algorithms for maximum linear arrangement. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:171-177 [Journal]
- Jérôme Monnot
The maximum f-depth spanning tree problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:179-187 [Journal]
- Minkyu Lee, Dongsoo Han, Jaeyong Shim
Set-based access conflict analysis of concurrent workflow definition. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:189-194 [Journal]
- Dong-Joo Park, Shin Heu, Hyoung-Joo Kim
The RS-tree: An efficient data structure for distance browsing queries. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:195-203 [Journal]
- Ye-In Chang, Bor-Hsu Chen
A generalized grid quorum strategy for k-mutual exclusion in distributed systems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:205-212 [Journal]
- Goran Konjevod, R. Ravi, F. Sibel Salman
On approximating planar metrics by tree metrics. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2001, v:80, n:4, pp:213-219 [Journal]
|