Volume 42, Number 1, January 2002
- Ulrich Meyer, Jop F. Sibeyn:
Oblivious Gossiping on Tori.
1-19

- Reuven Bar-Yehuda, Dror Rawitz:
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.
20-40

- Matti Nykänen, Esko Ukkonen:
The Exact Path Length Problem.
41-53

- Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
54-68

- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees.
69-108

- Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-Center Problem with Obstacles.
109-134

- Pangfeng Liu:
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems.
135-152

- C. R. Subramanian, C. E. Veni Madhavan:
General Partitioning on Random Graphs.
153-172

- Takao Asano, David P. Williamson:
Improved Approximation Algorithms for MAX SAT.
173-202

Volume 42, Number 2, February 2002
Last update Thu May 23 15:04:58 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page