|
|
Journals in DBLP
J. Algorithms
2002, volume: 42, number: 1
- Ulrich Meyer, Jop F. Sibeyn
Oblivious Gossiping on Tori. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:1-19 [Journal]
- Reuven Bar-Yehuda, Dror Rawitz
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:20-40 [Journal]
- Matti Nykänen, Esko Ukkonen
The Exact Path Length Problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:41-53 [Journal]
- Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige
Locating Sources to Meet Flow Demands in Undirected Networks. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:54-68 [Journal]
- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
On Graph Powers for Leaf-Labeled Trees. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:69-108 [Journal]
- Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
The 2-Center Problem with Obstacles. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:109-134 [Journal]
- Pangfeng Liu
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:135-152 [Journal]
- C. R. Subramanian, C. E. Veni Madhavan
General Partitioning on Random Graphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:153-172 [Journal]
- Takao Asano, David P. Williamson
Improved Approximation Algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2002, v:42, n:1, pp:173-202 [Journal]
|
