## Volume 27,
Numbers 1-2,
May 1990

- Pavol Hell:

**Preface.
**1

- Alok Aggarwal, Maria M. Klawe:

**Applications of generalized matrix searching to geometric algorithms.
**3-23

- Noga Alon, Yossi Azar, Yiftach Ravid:

**Universal sequences for complete graphs.
**25-28

- Richard P. Anstee:

**Simplified existence theorems for (g, f)-factors.
**29-38

- David Avis, Mike Doskas:

**Algorithms for high dimensional stabbing problems.
**39-48

- Yossi Azar, Nicholas Pippenger:

**Parallel selection.
**49-58

- F. Cheah, Derek G. Corneil:

**The complexity of regular subgraph recognition.
**59-68

- N. Dadoun, David G. Kirkpatrick:

**Parallel algorithms for fractional and maximal independent sets in planar graphs.
**69-83

- Peter L. Hammer, Frédéric Maffray:

**Completely separable graphs.
**85-99

- Janelle J. Harms, Charles J. Colbourn:

**Probabilistic single processor scheduling.
**101-112

- David W. Matula, Farhad Shahrokhi:

**Sparsest cuts and bottlenecks in graphs.
**113-123

- Hiroshi Nagamochi, Toshihide Ibaraki:

**Multicommodity flows in certain planar directed networks.
**125-145

- Richard J. Nowakowski, Ivan Rival, Jorge Urrutia:

**Representing orders on the plane by translating points and lines.
**147-156

- Hitoshi Suzuki, Akira Ishiguro, Takao Nishizeki:

**Edge-disjoint paths in a grid bounded by two nested rectangles.
**157-178

- Peter Winkler:

**Mean distance in a tree.
**179-185

## Volume 27,
Number 3,
June 1990

Copyright © Mon Nov 2 21:30:59 2009
by Michael Ley (ley@uni-trier.de)