The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
New to eBooks.com?Learn more
- Bestsellers - This Week
- Foreign Language Study
- Bestsellers - Last 6 months
- Graphic Books
- Health & Fitness
- Political Science
- Biography & Autobiography
- Psychology & Psychiatry
- Body Mind & Spirit
- House & Home
- Business & Economics
- Children's & Young Adult Fiction
- Juvenile Nonfiction
- Language Arts & Disciplines
- Crafts & Hobbies
- Science Fiction
- Current Events
- Literary Collections
- Literary Criticism
- Literary Fiction
- Social Science
- The Environment
- Sports & Recreation
- Family & Relationships
- Study Aids
- Folklore & Mythology
- Food and Wine
- Performing Arts
- True Crime
- Foreign Language Books
Most popular at the top
- Elsevier Science 2012; US$ 72.95
Combinatorial and Geometric Structures and Their Applications more...
- Elsevier Science 2011; US$ 240.00
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory.... more...
- Elsevier Science 2011; US$ 142.00
Combinatorial mathematics, optimal designs, and their applications more...
- Elsevier Science 1988; US$ 72.95
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic... more...
- Elsevier Science 1985; US$ 72.95
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems. more...
- Springer 2008; US$ 109.00
Presents a number of algorithms, and includes chapters devoted to topics such as branchings, feedback arc and vertex sets, connectivity augmentations, sparse subdigraphs with prescribed connectivity. This book focuses on applications which include quantum mechanics, bioinformatics, embedded computing, and the travelling salesman problem. more...
- Elsevier Science 1989; US$ 72.95
Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson's Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations. The Hanani volume is a collection of research... more...
- Springer 2009; US$ 189.00
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. This book provides an introduction into various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques. more...
- Springer 2010; US$ 129.00
This book will provide a unique and invaluable source for researchers and graduate students. From the Reviews: "This book is definitely a milestone in the literature of integer programming and combinatorial optimization. more...