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 …

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 …

An amorphous computing medium is a system of irregularly placed, asynchronous, locally
interacting computing elements. I have demonstrated that amorphous media can be …

Layout refers to the process of determining the sizes and positions of the visual objects that
are part of an information presentation. Automated layout refers to the use of a computer …

Given a finite, undirected, simple graph G, we are concerned with operations on G that
transform it into a planar graph. We give a survey of results about such operations and …

We consider relations between the size, treewidth, and local crossing number (maximum
number of crossings per edge) of graphs embedded on topological surfaces. We show that …

Archdeacon (1987) proved that graphs embeddable on a fixed surface can be 3-coloured so
that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang …

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 …