Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and
studies geometric representations of nonplanar graphs in terms of forbidden crossing …

The notion of 1-planarity is among the most natural and most studied generalizations of
graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at …

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 graph is near-planar if it can be obtained from a planar graph by adding an edge. We
show the surprising fact that it is NP-hard to compute the crossing number of near-planar …

The structural parameter twin-width was introduced by Bonnet et al. in [FOCS 2020], and
already this first paper included an asymptotic argument bounding the twin-width of planar …

We give new results about the relationship between 1-planar graphs and RAC graphs. A
graph is 1-planar if it has a drawing where each edge is crossed at most once. A graph is …

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most
once. In general, 1-planar graphs do not admit straight-line drawings. We show that every 3 …

A graph is outer 1-planar (o1p) if it can be drawn in the plane such that all vertices are in the
outer face and each edge is crossed at most once. o1p graphs generalize outerplanar …

We introduce the family of k-gap-planar graphs for k≥ 0, ie, graphs that have a drawing in
which each crossing is assigned to one of the two involved edges and each edge is …