Discrete mathematics

In diesem Lehrbuch werden die mathematischen Grundlagen exakt und dennoch anschaulich und gut nachvollziehbar vermittelt.

This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012.

This book offers an introduction to the theory of groupoids and their representations encompassing the standard theory of groups.

This book features a selection of best papers from 13 workshops held at the International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017, held in Sao Paulo, Brazil, in May 2017.

Entertaining, surprising and challenging mathematics problems of the sort pondered by generations during afternoon tea.

A Tour Through Graph Theory introduces graph theory to students who are not mathematics majors.

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013.

Graph Theory is a branch of discrete mathematics.

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products.

This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.

Neutrices and External Numbers: A Flexible Number System introduces a new model of orders of magnitude and of error analysis, with particular emphasis on behaviour under algebraic operations.

This book constitutes the refereed proceedings of the Second Western European Workshop on Research in Cryptology, WEWoRC 2007, held in Bochum, Germany, in July 2007 The 12 revised full papers were carefully reviewed and selected from a total of 36 submissions.

The discrete mathematics and theoretical computer science communities have recently witnessed explosive growth in the area of algorithmic combinatorics on words.

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs.

These are the proceedings of the Workshop on Sequences, Subsequences, and Consequences that was held at the University of Southern California (USC), May 31 - June 2, 2007.

The Steiner problem asks for a shortest network which spans a given set of points.

Graph theory continues to be one of the fastest growing areas of modern mathematics because of its wide applicability in such diverse disciplines as computer science, engineering, chemistry, management science, social science, and resource planning.

Magic squares are among the more popular mathematical recreations.

This book constitutes the thoroughly refereed post-conference proceedings of the Third International Symposium on Combinatorial Optimization, ISCO 2014, held in Lisbon, Portugal, in March 2014.

The book Graph Theory and Decomposition covers major areas of the decomposition of graphs.

The two-volume set LNCS 10671 and 10672 constitutes the thoroughly refereed proceedings of the 16th International Conference on Computer Aided Systems Theory, EUROCAST 2017, held in Las Palmas de Gran Canaria, Spain, in February 2017.

This textbook introduces discrete mathematics by emphasizing the importance of reading and writing proofs.

This book explores combinatorial problems and insights in quantum field theory.

This book constitutes the proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2013, held in Athens, Greece, in May 2013.

Aimed toward upper undergraduate and graduate students in mathematics, this book examines the foremost forms of graph labelings including magic, harmonious, and graceful labelings.

Both classical geometry and modern differential geometry have been active subjects of research throughout the 20th century and lie at the heart of many recent advances in mathematics and physics.

This unique textbook comprehensively introduces the field of discrete event systems, offering a breadth of coverage that makes the material accessible to readers of varied backgrounds.

This book constitutes the refereed proceedings of the First International Workshop on Connectomics in NeuroImaging, CNI 2017, held in conjunction with MICCAI 2017 in Quebec City, Canada, in September 2017.

This book constitutes the proceedings of the 16th International Conference on Algorithms and Computation, WALCOM 2022, which was held in Jember, Indonesia, during March 24-26, 2022.

This book concentrates on mining networks, a subfield within data science.

This book deals with the theory and applications of the Reformulation- Linearization/Convexification Technique (RL T) for solving nonconvex optimization problems.

The main themes.

This Festschrift volume, published in honor of Jean-Jaques Quisquater on the occasion of his 65th Birthday, contains 33 papers from colleagues all over the world and deals with all the fields to which Jean-Jaques dedicated his work during his academic career.

This book constitutes the thoroughly refereed post-conference proceedings of the 24th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2014, held in Canterbury, UK, in September 2014.

The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe.

Mathematics for Engineers offers a comprehensive treatment of the core mathematical topics required for a modern engineering degree.

This book provides a valuable glimpse into discrete curvature, a rich new field of research which blends discrete mathematics, differential geometry, probability and computer graphics.

The idea for this book was conceived over the second bottle of Villa Maria's Caber- net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common.

This text provides a theoretical background for several topics in combinatorial mathematics, such as enumerative combinatorics (including partitions and Burnside's lemma), magic and Latin squares, graph theory, extremal combinatorics, mathematical games and elementary probability.