Configurations can be studied from a graph-theoretical viewpoint via the so-called Levi graphs and lie at the heart of graphs, groups, surfaces, and geometries, all of which are very active areas of mathematical exploration. In this self-contained textbook, algebraic graph theory is used to introduce groups; topological graph theory is used to explore surfaces; and geometric graph theory is implemented to analyze incidence geometries. After a preview of configurations in Chapter 1, a concise introduction to graph theory is presented in Chapter 2, followed by a geometric introduction to groups in Chapter 3. Maps and surfaces are combinatorially treated in Chapter 4. Chapter 5 introduces the concept of incidence structure through vertex colored graphs, and the combinatorial aspects of classical configurations are studied. Geometric aspects, some historical remarks, references, and applications of classical configurations appear in the last chapter. With over two hundred illustrations, challenging exercises at the end of each chapter, a comprehensive bibliography, and a set of open problems, Configurations from a Graphical Viewpoint is well suited for a graduate graph theory course, an advanced undergraduate seminar, or a self-contained reference for mathematicians and researchers.

This book constitutes the thoroughly refereed post-proceedings of the International Workshop on Graph Transformation with Industrial Relevance, AGTIVE'99, held in Kerkrade, The Netherlands, in June 1999. The 28 revised full papers presented went through an iterated process of reviewing and revision. Also included are three invited papers, 10 tool demonstrations, a summary of a panel discussion, and lists of graph transformation systems and books on graph transformations. The papers are organized in sections on modularization concepts, distributed systems modeling, software architecture: evolution and reengineering, visual graph transformation languages, visual language modeling and tool development, knowledge modeling, image recognition and constraint solving, process modeling and view integration, and visualization and animation tools.

This volume contains the proceedings of the conference on Riemann and Klein Surfaces, Symmetries and Moduli Spaces, in honor of Emilio Bujalance, held from June 24-28, 2013, at Linköping University. The conference and this volume are devoted to the mathematics that Emilio Bujalance has worked with in the following areas, all with a computational flavor: Riemann and Klein surfaces, automorphisms of real and complex surfaces, group actions on surfaces and topological properties of moduli spaces of complex curves and Abelian varieties.

This book provides an overview of the research work on data privacy and privacy enhancing technologies carried by the participants of the ARES project. ARES (Advanced Research in Privacy an Security, CSD2007-00004) has been one of the most important research projects funded by the Spanish Government in the fields of computer security and privacy. It is part of the now extinct CONSOLIDER INGENIO 2010 program, a highly competitive program which aimed to advance knowledge and open new research lines among top Spanish research groups. The project started in 2007 and will finish this 2014. Composed by 6 research groups from 6 different institutions, it has gathered an important number of researchers during its lifetime. Among the work produced by the ARES project, one specific work package has been related to privacy. This books gathers works produced by members of the project related to data privacy and privacy enhancing technologies. The presented works not only summarize important research carried in the project but also serve as an overview of the state of the art in current research on data privacy and privacy enhancing technologies.

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and computational tools and techniques of the geometric constraint system (GCS). It functions as a single source containing the core principles and results, accessible to both beginners and experts. The handbook provides a guide for students learning basic concepts, as well as experts looking to pinpoint specific results or approaches in the broad landscape. As such, the editors created this handbook to serve as a useful tool for navigating the varied concepts, approaches and results found in GCS research. Key Features: A comprehensive reference handbook authored by top researchers Includes fundamentals and techniques from multiple perspectives that span several research communities Provides recent results and a graded program of open problems and conjectures Can be used for senior undergraduate or graduate topics course introduction to the area Detailed list of figures and tables About the Editors: Meera Sitharam is currently an Associate Professor at the University of Florida’s Department of Computer & Information Science and Engineering. She received her Ph.D. at the University of Wisconsin, Madison. Audrey St. John is an Associate Professor of Computer Science at Mount Holyoke College, who received her Ph. D. from UMass Amherst. Jessica Sidman is a Professor of Mathematics on the John S. Kennedy Foundation at Mount Holyoke College. She received her Ph.D. from the University of Michigan.

This book consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry. Most of the chapters were collected at the conference “Geometry and Symmetry” in Veszprém, Hungary from 29 June to 3 July 2015. The conference was dedicated to Károly Bezdek and Egon Schulte on the occasion of their 60th birthdays, acknowledging their highly regarded contributions in these fields. While the classical problems of discrete geometry have a strong connection to geometric analysis, coding theory, symmetry groups, and number theory, their connection to combinatorics and optimization has become of particular importance. The last decades have seen a revival of interest in discrete geometric structures and their symmetry. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory and geometry, combinatorial group theory, and hyperbolic geometry and topology. This book contains papers on new developments in these areas, including convex and abstract polytopes and their recent generalizations, tiling and packing, zonotopes, isoperimetric inequalities, and on the geometric and combinatorial aspects of linear optimization. The book is a valuable resource for researchers, both junior and senior, in the field of discrete geometry, combinatorics, or discrete optimization. Graduate students find state-of-the-art surveys and an open problem collection.