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 …

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 …

A circle graph is an intersection graph of a set of chords of a circle. We describe the
unavoidable induced subgraphs of circle graphs with large treewidth. This includes …

Tree decompositions of graphs are of fundamental importance in structural and algorithmic
graph theory. Planar decompositions generalise tree decompositions by allowing an …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …

Bhatt and Leighton proved that the crossing number of a network (graph) is closely related to
the minimum layout area required for the implementation of a VLSI circuit for that network …

This glossary contains an annotated listing of some 300 parameters of graphs, together with
their definitions, and, for most of these, a reference to the authors who introduced them. Let …

The k-planar crossing number of a graph is the minimum number of crossings of its edges
over all possible drawings of the graph in k planes. We propose algorithms and methods for …

A-page book drawing of a graph is a drawing of on halfplanes with a line as a common
boundary such that the vertices are located on and the edges cannot cross. The-page book …

We propose several new heuristics for the twopage book crossing problem, which are based
on recent algorithms for the corresponding one-page problem. Especially, the neural …