Our search has the following Google-type functionality:

If you use '+' at the start of a word, that word will be present in the search results.

*eg. Harry +Potter*

*Search results will contain 'Potter'.*

If you use '-' at the start of a word, that word will be absent in the search results.

*eg. Harry -Potter*

*Search results will not contain 'Potter'.*

If you use 'AND' between 2 words, then both those words will be present in the search results.

*eg. Harry AND Potter*

*Search results will contain both 'Harry' and 'Potter'.*

NOTE: AND will only work with single words not phrases.

If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.

*eg. 'Harry OR Potter'*

*Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.*

NOTE: OR will only work with single words not phrases.

If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).

*eg. 'Harry NOT Potter'*

*Search results will not contain 'Potter'.*

NOTE: NOT will only work with single words not phrases.

If you use double quotation marks around words, those words will be present in that order.

*eg. "Harry Potter"*

*Search results will contain 'Harry Potter', but not 'Potter Harry'.*

NOTE: "" cannot be combined with AND, OR & NOT searches.

If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).

*eg. 'Pot*er'*

*Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.*

- Sort Results By

As linear orders, as elements of the symmetric group, modeled by matrices, modeled by graphs, permutations are omnipresent... [more]

Unifying applied mathematics, physics, and engineering, this book looks at how generalized functions are used in physics and... [more]

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for... [more]

The material has been extensively class-tested for over ten years at both the author's own university and other institutions.<br... [more]

Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring,... [more]

On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian,... [more]

The biosciences are generating new research directions in mathematical sciences. This book presents a new combinatorial theory... [more]

Richard Stanley's two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for... [more]

Several geometric problems can be formulated in terms of the arrangements of a collection of curves in a plane, making this... [more]

RC4 Stream Cipher and Its Variants is the first book to fully cover the popular software stream cipher RC4. With extensive... [more]

Expander families enjoy a wide range of applications in mathematics and computer science, and their study is a fascinating... [more]

To truly understand how the Internet and Web are organized and function requires knowledge of mathematics and computation... [more]

* Graph partitioning is a theoretical subject with applications in many areas, principally: numerical analysis, programs mapping... [more]

This volume contains articles based on the invited lectures given at the 23rd British Combinatorial Conference, held in July... [more]

The book integrates approaches from mathematics, physics and computer sciences to analyse the organisation of complex networks.... [more]

A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the... [more]

Combinatorics on words appears in many different areas of mathematics and theoretical computer science. With background material,... [more]

This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings... [more]

Based on the author's graduate course on association schemes and the optimal design of scientific experiments, this book is... [more]

Extensively revised, reorganized, updated, and expanded ed. of: Product graphs, structure, and recognition / Wilfried Imrich,... [more]

This fascinating 2003 collection of articles runs the gamut from new theoretical approaches, both computational and mathematical,... [more]

This 1997 work explores the role of probabilistic methods for solving combinatorial problems. The author pays special attention... [more]

This major revision of James Oxley's classic Matroid Theory provides a comprehensive introduction to the subject, covering... [more]

This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings... [more]

This book is based on Professor Harper's experience in teaching global methods in combinatorial optimization and is ideal... [more]