DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 1994; 399 pp; hardcover Volume: 15 ISBN10: 0821866052 ISBN13: 9780821866054 List Price: US$98 Member Price: US$78.40 Order Code: DIMACS/15
 With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing generalpurpose software and integrated software systems for domains in discrete mathematics, including graph theory, combinatorics, combinatorial optimization, and sets. This software aims to provide effective computational tools for research, applications prototyping, and teaching. In March 1992, DIMACS sponsored a workshop on Computational Support for Discrete Mathematics in order to facilitate interactions between the researchers, developers, and educators who work in these areas. Containing refereed papers based on talks presented at the workshop, this volume documents current and past research in these areas and should provide impetus for new interactions. Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 17 were copublished with the Association for Computer Machinery (ACM). Readership Mathematicians and computer scientists. Table of Contents  A. Bhansali and S. S. Skiena  Analyzing integer sequences
 M. Stallmann, R. Cleaveland, and P. Hebbar  GDR: A visualization tool for graph algorithms
 G. Havas and E. F. Robertson  Application of computational tools for finitely presented groups
 P. A. Gloor, I. Lee, and A. VelezSosa  Animated algorithms: Computer science education with algorithm animation
 J. Abello, S. Sudarsky, T. Veatch, and J. Waller  AGE: An animated graph environment
 D. S. Dillon and F. R. Smietana  An interactive, graphical, educationally oriented graph analysis package
 G. H. Bradley and H. F. Oliveira  Network assistant: To construct, test, and analyze graph network algorithms
 K.W. Lih, N. Dean, and M. Mihail  Computing spanning trees in NETPAD
 B. M. E. Moret and H. D. Shapiro  An empirical assessment of algorithms for constructing a minimum spanning tree
 C. Thomborson, B. Alpern, and L. Carter  Rectilinear Steiner tree minimization on a workstation
 P. Schorn  The XYZ GeoBench for the experimental evaluation of geometric algorithms
 D. A. Berque and M. K. Goldberg  Monitoring an algorithm's execution
 T.S. Hsu, V. Ramachandran, and N. Dean  Implementation of parallel graph algorithms on the MasPar
 A. L. Buchsbaum and M. Mihail  Monte Carlo and Markov chain techniques for network reliability and sampling
 D. D. Harms, J. S. Devitt, and C. J. Colbourn  Networks and reliability in MAPLE
 G. Zimmerman, A. H. Esfahanian, and D. Vasquez  GMP/X, An Xwindows based graph manipulation package
 C. Gomez and M. Goursat  METANET: A system for network analysis
 V. J. Leung, M. B. Dillencourt, and A. L. Bliss  GraphTool: A tool for interactive design and manipulation of graphs and graph algorithms
 M. Krishnamoorthy, A. Suess, M. Onghena, F. Oxaal, and T. Spencer  Improvements to GraphPack: A system to manipulate graphs and digraphs
 J. I. Helfman and J. L. Gross  Extending a graph browser for topological graph theory
 L. A. Sanchis  Test case construction for the vertex cover problem
 M. Delest and N. Rouillon  CalICo: Software for combinatorics
 M. Delest  Formal calculus and enumerative combinatorics
 K. Sutner  Implementing finite state machines
 D. Caugherty and S. H. Rodger  NPDA: A tool for visualizing and simulating nondeterministic pushdown automata
 I. J. Dejter  Recognizing the hidden structure of Cayley graphs
 D. Möller and R. Müller  A concept for the representation of data and algorithms
