Volume 22,
Number 1,
January 1997
- Andrew V. Goldberg:
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm.
1-29 BibTeX
- Edith Cohen:
Using Selective Path-Doubling for Parallel Shortest-Path Computations.
30-56 BibTeX
- Leonidas Palios:
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments.
57-92 BibTeX
- Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
On-Line Load Balancing of Temporary Tasks.
93-110 BibTeX
- Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Deterministic Permutation Routing on Meshes.
111-141 BibTeX
- Himanshu Gupta, Rephael Wenger:
Constructing Piecewise Linear Homeomorphisms of Simple Polygons.
142-157 BibTeX
- Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit:
Slide-The Key to Polynomial End-to-End Communication.
158-186 BibTeX
- Michal Penn, Haya Shasha-Krupnik:
Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems.
187-196 BibTeX
Volume 22,
Number 2,
February 1997
Copyright © Wed Jun 4 19:13:25 2008
by Michael Ley (ley@uni-trier.de)
