# The Leading eBooks Store Online

## for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry...

Most popular at the top

#### Graphs of Groups on Surfaces

Elsevier Science 2001; US$ 235.00The book, suitable as both an introductory reference and as a text book in the rapidly growing field of topological graph theory, models both maps (as in map-coloring problems) and groups by means of graph imbeddings on sufaces. Automorphism groups of both graphs and maps are studied. In addition connections are made to other areas of mathematics,... more...

#### Covering Codes

Elsevier Science 1997; US$ 260.00The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems. Scientists involved in discrete mathematics, combinatorics, computer... more...

#### The Construction of Optimal Stated Choice Experiments

Wiley 2007; US$ 130.00The most comprehensive and applied discussion of stated choice experiment constructions available The Construction of Optimal Stated Choice Experiments provides an accessible introduction to the construction methods needed to create the best possible designs for use in modeling decision-making. Many aspects of the design of a generic stated choice... more...

#### Algorithmic Graph Theory and Perfect Graphs

Elsevier Science 2004; US$ 106.00Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many... more...

#### Codes on Euclidean Spheres

Elsevier Science 2001; US$ 220.00Codes on Euclidean spheres are often referred to as spherical codes. They are of interest from mathematical, physical and engineering points of view. Mathematically the topic belongs to the realm of algebraic combinatorics, with close connections to number theory, geometry, combinatorial theory, and - of course - to algebraic coding theory. The connections... more...

#### Das Geheimnis des kürzesten Weges

Springer Berlin Heidelberg 2005; US$ 29.99Mit dem Auto auf möglichst kurzem Wege von München nach Hamburg zu fahren, ist keine große Übung: Es geht auf die Autobahn und dann immer geradeaus. Eine Route durch 15 112 Orte in Deutschland zu planen, ohne ein Dorf, eine Stadt zwei Mal zu besuchen, ist dagegen deutlich schwieriger. Ruth, 15 Jahre und von Mathematik alles andere als begeistert... more...

#### Graph Theory in Paris

Springer 2006; US$ 179.00In July 2004, a conference on graph theory was held in Paris in memory of Claude Berge, one of the pioneers of the field. The event brought together many prominent specialists on topics, such as perfect graphs and matching theory, upon which Claude Berge's work has had a major impact. This volume includes contributions to these and other topics... more...

#### Threshold Graphs and Related Topics

Elsevier Science 1995; US$ 72.95Threshold graphs have a beautiful structure and possess many important mathematical properties. They have applications in many areas including computer science and psychology. Over the last 20 years the interest in threshold graphs has increased significantly, and the subject continues to attract much attention. The book contains many open problems... more...

#### The Pursuit of Perfect Packing, Second Edition

CRC Press 2008; US$ 79.95Prefaces How Many Sweets in the Jar? Loose Change and Tight Packing A Teasing but Tractable Problem A Handful of Coins Order and Disorder Hard Problems with Hard Spheres The Greengrocer?s Dilemma Ordered Close Packing?The Kepler Problem The Kepler Conjecture Marvelous Clarity, Neurotic Anxiety: The Life of Kepler... more...

#### Probability and Real Trees

Springer 2007; US$ 59.95Random trees and tree-valued stochastic processes are of particular importance in combinatorics, computer science, phylogenetics, and mathematical population genetics. Using the framework of abstract "tree-like" metric spaces (so-called real trees) and ideas from metric geometry such as the Gromov-Hausdorff distance, Evans and his collaborators... more...