Contemporary Mathematics 1989; 197 pp; softcover Volume: 89 Reprint/Revision History: reprinted 1991 ISBN10: 0821850954 ISBN13: 9780821850954 List Price: US$38 Member Price: US$30.40 Order Code: CONM/89
 This volume contains the proceedings of the AMSIMSSIAM Joint Summer Research Conference on Graphs and Algorithms, held in 1987 at the University of Colorado in Boulder. The purpose of the conference was to foster communication between computer scientists and mathematicians, for recent work in graph theory and related algorithms has relied on increasingly sophisticated mathematics. Wagner's Conjecture, selfadjusting data structures, graph isomorphism, and various embedding and labelling problems in VLSI are examples of the kinds of questions now facing the field. With around 65 participants, the conference brought out the depth and diversity of current research in this area. The wide range of topics covered in this volume demonstrates the vitality of the activity in both mathematics and computer science and captures the diversity and excitement of the conference. Table of Contents  M. R. Fellows  The RobertsonSeymour theorems: A survey of applications
 J. P. Hutchinson  On genusreducing and planarizing algorithms for embedded graphs
 A. L. Rosenberg  Interval hypergraphs
 M. S. Manasse, L. A. McGeoch, and D. D. Sleator  Competitive algorithms for online problems
 L. I. Basenspiler  On recognizability of planar graphs
 M. Fried  Combinatorial computation of moduli dimension of Nielsen classes of covers
 R. Grossman and R. G. Larson  Labeled trees and the algebra of differential operators
 A. M. Hobbs  Computing edgetoughness and fractional arboricity
 B. W. Jackson  Directed graphs and the compaction of IC designs
 P. N. Klein  Parallelism, preprocessing, and reachability
 P. J. Slater  A summary of results on pairconnected reliability
 J. L. Szwarcfiter  On minimum cuts of cycles and maximum disjoint cycles
 A. Vince  Graphs and finitely presented groups
