Volume 28,
Number 1,
July 1998
- Lawrence L. Larmore, Teresa M. Przytycka:
The Optimal Alphabetic Tree Problem Revisited.
1-20
- Yanjun Zhang:
The Variance of Two Game Tree Algorithms.
21-39
- Shay Kutten, David Peleg:
Fast Distributed Construction of Small k-Dominating Sets and Applications.
40-66
- Baruch Awerbuch, Yair Bartal, Amos Fiat:
Distributed Paging for General Networks.
67-104
- Cristina G. Fernandes:
A Better Approximation Ratio for the Minimum Size k-Edge-Connected Spanning Subgraph Problem.
105-124
- Stavros G. Kolliopoulos, Clifford Stein:
Finding Real-Valued Single-Source Shortest Paths in o(n3) Expected Time.
125-141
- Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Bicriteria Network Design Problems.
142-171
- Dominique Foata, Guo-Niu Han:
Transformations on Words.
172-191
- Samir Khuller:
Problems.
192-195
Volume 28,
Number 2,
August 1998
- Omer Berkman, Yossi Matias, Prabhakar Ragde:
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.
197-215
- Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai, Jeng-Yan Hwang:
The Recognition of Double Euler Trails in Series-Parallel Networks.
216-257
- Jing Chao Chen:
Quadripartite Sort.
258-271
- Ton Kloks, Dieter Kratsch, C. K. Wong:
Minimum Fill-in on Circle and Circular-Arc Graphs.
272-289
- Hillel Gazit, John H. Reif:
A Randomized Parallel Algorithm for Planar Graph Isomorphism.
290-314
- Pinaki Mitra, Subhas C. Nandy:
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles.
315-338
- Amotz Bar-Noy, Guy Kortsarz:
Minimum Color Sum of Bipartite Graphs.
339-365
Copyright © Sat Nov 28 22:30:57 2009
by Michael Ley (ley@uni-trier.de)
