Discrete mathematics, the study of finite structures, is one of the fastest growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development in this field.
Wiley-Interscience Series in Discrete Mathematics and Optimization (32)
by Noga Alon, Joel H. Spencer
August 2008, Hardcover
by Edwin K. P. Chong, Stanislaw H. Zak
February 2008, Hardcover
by Aiden A. Bruen, Mario A. Forcinito
December 2004, Hardcover
by Sandra Arlinghaus, William C. Arlinghaus, Frank Harary
April 2002, Downloadable content
by Wojciech Szpankowski
April 2001, Hardcover
by Russell Merris
November 2000, Hardcover
by Noga Alon, Joel H. Spencer
by Hosam M. Mahmoud
August 2000, Hardcover
by John Hooker
May 2000, Hardcover
by Wilfried Imrich, Sandi Klavžar
April 2000, Hardcover
by Svante Janson, Tomasz Luczak, Andrzej Rucinski
March 2000, Hardcover
by Ding-Zhu Du, Ker-I Ko
January 2000, Hardcover
by Mario Martelli
September 1999, Hardcover
by Laurence A. Wolsey, George L. Nemhauser
July 1999, Paperback
by Vijay Chandru, John Hooker
March 1999, Hardcover
by Wilfred Kaplan
November 1998, Hardcover
by Laurence A. Wolsey
September 1998, Hardcover
by Charles F. Laywine, Gary L. Mullen
September 1998, Hardcover