CONTENTS
Foreword
Organizing Committee
List of Participants
The Robertson-Seymour theorems: A survey of applications
MICHAEL R. FELLOWS
On genus-reducing and planarizing algorithms for embedded graphs
JOAN P. HUTCHINSON
Interval hypergraphs
ARNOLD L. ROSENBERG
Competitive algorithms for on-line problems
MARKS. MANASSE, LYLE A. McGEOCH,
and DANIEL D. SLEATOR
On recognizability of planar graphs
LARRY I. BASENSPILER
Combinatorial computation of moduli dimension of Nielsen classes
of covers
MIKE FRIED
Labeled trees and the algebra of differential operators
ROBERT GROSSMAN and RICHARD G. LARSON
Computing edge-toughness and fractional arboricity
ARTHUR M. HOBBS
Directed graphs and the compaction of IC designs
BRADLEY W. JACKSON
Parallelism, preprocessing, and reachability
PHILIP N. KLEIN
A summary of results on pair-connected reliability
PETER J. SLATER
ix
Xl
xm
xiii
19
27
45
55
61
81
89
107
129
145
Previous Page Next Page