Volume 42,
Number 1,
January 2002
- Ulrich Meyer, Jop F. Sibeyn:
Oblivious Gossiping on Tori.
1-19
Electronic Edition (link) BibTeX
- Reuven Bar-Yehuda, Dror Rawitz:
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property.
20-40
Electronic Edition (link) BibTeX
- Matti Nykänen, Esko Ukkonen:
The Exact Path Length Problem.
41-53
Electronic Edition (link) BibTeX
- Kouji Arata, Satoru Iwata, Kazuhisa Makino, Satoru Fujishige:
Locating Sources to Meet Flow Demands in Undirected Networks.
54-68
Electronic Edition (link) BibTeX
- Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees.
69-108
Electronic Edition (link) BibTeX
- Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-Center Problem with Obstacles.
109-134
Electronic Edition (link) BibTeX
- Pangfeng Liu:
Broadcast Scheduling Optimization for Heterogeneous Cluster Systems.
135-152
Electronic Edition (link) BibTeX
- C. R. Subramanian, C. E. Veni Madhavan:
General Partitioning on Random Graphs.
153-172
Electronic Edition (link) BibTeX
- Takao Asano, David P. Williamson:
Improved Approximation Algorithms for MAX SAT.
173-202
Electronic Edition (link) BibTeX
Volume 42,
Number 2,
February 2002
Copyright © Sun May 17 00:06:10 2009
by Michael Ley (ley@uni-trier.de)