A collection of research articles and extended abstracts submitted at the Planar Graphs Workshop held at DIMACS in November 1991. The book covers a range of topics, including enumeration, characterization problems, algorithms, extremal problems, and network flows and geometry.

With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing general-purpose 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...

Connectivity and facilities location are two important topics in network design, with applications in data communication, transportation, production planning, and VLSI designs. There are two issues concerning these topics: design and optimization. They involve combinatorial design and combinatorial optimization. This volume features talks presented at an interdisciplinary research workshop held at DIMACS in April 1997. The workshop was attended by leading theorists, algorithmists, and practitioners working on network design problems.

This volume is based on two DIMACS working group meetings on bioconsensus. It provides an introduction and reference to the various aspects of this rapidly developing field. The meetings brought together mathematical and biological scientists to discuss the uses in the biological sciences of methods of consensus and social choice. These two lively meetings contributed much toward establishing the new field of bioconsensus. Yet the book aims to be more than just a report of two meetings. It includes some historical background, as well as a substantial introduction to the axiomatic foundations...

This volume presents reviewed and revised papers from the fifth and sixth DIMACS Implementation Challenge workshops. These workshops, held approximately annually, aim at encouraging high-quality work in experimental analysis of data structures and algorithms. The papers published in this volume are the results of year-long co-ordinated research projects and contain up-to-date findings and insights. Three papers address the performance evaluation of implementations for two fundamental data structures, dictionaries and priority queues as used in the context of real applications. Another four...

Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of modern research. The articles are based on talks given at the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry.

This volume presents the proceedings from the Mid-Atlantic Mathematical Logic Seminar (MAMLS) conference held in honor of Andras Hajnal at the DIMACS Center, Rutgers University (New Brunswick, USA). Articles include both surveys and high-level research papers written by internationally recognized experts in the field of set theory. Many of the current active areas of set theory are represented in this volume. It includes research papers on combinatorial set theory, set theoretic topology, descriptive set theory, and set theoretic algebra. There are valuable surveys on combinatorial set...

This volume presents papers related to the DIMACS workshop, Codes and Association Schemes. The articles are devoted to the following topics: applications of association schemes and of the polynomial method to properties of codes, structural results for codes, structural results for association schemes, and properties of orthogonal polynomials and their applications in combinatorics. Papers on coding theory are related to classical topics, such as perfect codes, bounds on codes, codes and combinatorial arrays, weight enumerators, and spherical designs. Papers on orthogonal polynomials provide...

Interest has grown recently in the application of computational and statistical tools to problems in the analysis of algorithms. In many algorithmic domains, worst-case bounds are too pessimistic and tractable probabilistic models too unrealistic to provide meaningful predictions of practical algorithmic performance. Experimental approaches can provide knowledge where purely analytical methods fail and can provide insights to motivate and guide deeper analytical results. The DIMACS Implementation Challenge was organized to encourage experimental work in the area of network flows and...