This is the first book devoted to the systematic study of sparse graphs and sparse finite
structures. Although the notion of sparsity appears in various contexts and is a typical …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

This paper surveys how the concept of crossing number, which used to be familiar only to a
limited group of specialists, emerges as a significant graph parameter. This paper has dual …

Graph layout algorithms typically conform to one or more aesthetic criteria (eg minimizing
the number of bends, maximizing orthogonality). Determining the extent to which a graph …

The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …

A string graph is the intersection graph of a set of curves in the plane. Each curve is
represented by a vertex, and an edge between two vertices means that the corresponding …

Crossing Numbers of Graphs is the first book devoted to the crossing number, an
increasingly popular object of study with surprising connections. The field has matured into a …

Among the intuitively appealing aspects of graph theory is its close connection to drawings
and geometry. The development of computer technology has become a source of motivation …

Twenty years ago, Ajtai, Chvátal, Newborn, Szemerédi, and, independently, Leighton
discovered that the crossing number of any graph with v vertices and e> 4 v edgesis at least …