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...

The Computer and Games conference series is a major international...

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide...

For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....

In this lecture we discuss a type of computer organization which is based upon the concept of operation sequencing being controlled by operand availability. Such sequencing...

Cutting planes (cuts) are very popular in the OR community, where they are used to strengthen the Linear Programming (LP) relaxation of Mixed-Integer Programs (MIPs) in the hope of improving the performance of an exact LPbased solver. In particular, an intense research effort has been devoted to the study of families of general cuts,...

The papers in this volume were presented at the 20th Annual International Symposium on Algorithms and Computation, held December 16–18, 2009, in Hawaii, USA. In response to the Call-for-Papers, 279 papers were submitted. Each paper received at least three reviews by either Program Committee members or experts selected by Program...

From July 22 to July 24, 2010, the Technische Universit¨at M¨unchen, Germany, hosted the eighth edition of the now well-established ADG workshop dedicated to Automatic Deduction in Geometry. From the first edition, which was held in Toulouse in 1996, to ADG 2010, a slow mutation has taken place. The workshop that was formerly...