We have been very pleased, beyond our expectations, with the reception of the first edition of this book. Bioinformatics, however, continues to evolve very rapidly, hence the need for a new edition. In the past three years, fullgenome sequencing has blossomed with the completion of the sequence of the fly and the first draft of the...

This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It is explored how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography. It is also shown...

Discrete Mathematics and its Applications is a focused introduction to the primary themes in a discrete mathematics course, as introduced through extensive applications, expansive discussion, and detailed exercise sets. These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced...

Since the appearance in 1975 of this work, the field of combinatorial algorithms has continued its rapid evolution. We have substantially rewritten several of the chapters in order to take account of theoretical or algorithmic improvements, and to clarify the presentation.

The result has been that a number of speedups,...

Constraint Satisfaction Problems (CSP) prove to be a generic framework which can be applied for modeling and solving a wide range...

On the other hand I've...

The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would...