This book is the first and only one of its kind on the topic of Cops and Robbers games, and more generally, on the field of vertex pursuit games on graphs. The book is written in a lively and highly readable fashion, which should appeal to both senior undergraduates and experts in the field (and everyone in between). One of the main goals of the book is to bring together the key results in the field; as such, it presents structural, probabilistic, and algorithmic results on Cops and Robbers games. Several recent and new results are discussed, along with a comprehensive set of references. The book is suitable for self-study or as a textbook, owing in part to the over 200 exercises. The reader will gain insight into all the main directions of research in the field and will be exposed to a number of open problems.

Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition is a ScholarlyEditions™ book that delivers timely, authoritative, and comprehensive information about Approximation Theory. The editors have built Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition on the vast information databases of ScholarlyNews.™ You can expect the information about Approximation Theory in this book to be deeper than what you can access anywhere else, as well as consistently reliable, authoritative, informed, and relevant. The content of Issues in Logic, Probability, Combinatorics, and Chaos Theory: 2013 Edition has been produced by the world’s leading scientists, engineers, analysts, research institutions, and companies. All of the content is from peer-reviewed sources, and all of it is written, assembled, and edited by the editors at ScholarlyEditions™ and available exclusively from us. You now have a source you can cite with authority, confidence, and credibility. More information is available at http://www.ScholarlyEditions.com/.

Combinatorial games are games of pure strategy involving two players, with perfect information and no element of chance. Starting from the very basics of gameplay and strategy, the authors cover a wide range of topics, from game algebra to special classes of games. Classic techniques are introduced and applied in novel ways to analyze both old and

This book constitutes the refereed proceedings of the 8th International Conference on Theory and Applications of Models of Computation, TAMC 2011, held in Tokyo, Japan, in May 2011. The 51 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from 136 submissions. The papers address the three main themes of the conference which were computability, complexity, and algorithms and are organized in topical sections on general algorithms, approximation, graph algorithms, complexity, optimization, circuit complexity, data structures, logic and formal language theory, games and learning theory, and cryptography and communication complexity.

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Vancouver, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.

This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.

The Grand Master of Mystery delivers “nerve-end-entertainment” when two of New York’s finest set out to become two of New York’s richest (Kirkus Reviews). Tom and Joe have been walking the beat on the mean streets of the Big Apple longer than they can remember—or care to. They’ve been good cops, protecting the public and holding the line against crime and chaos in a city that has plenty of both. And all they have to show for it is a whole lot of nothing. But now the partners have devised a scheme to make all their dreams come true: the perfect heist. Tom and Joe are going to rob the fat cats on Wall Street for millions and walk away clean. With the right connections and the proper execution, there’s no way their plan can fail. And that’s why they’re so surprised when everything goes totally, hysterically wrong . . . With Cops and Robbers, the three-time Edgar Award–winning author, named a Grand Master by the Mystery Writers of America, offers “another very hot and successful” novel with “a siren shrill finale” (Kirkus Reviews). Praise for Donald E. Westlake “Westlake has no peer in the realm of comic mystery novelists.” —San Francisco Chronicle “No writer can excel Donald E. Westlake.” —Los Angeles Times