  A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of
its vertices along a spine and an assignment of each edge to one of the $k$
pages, which are half-planes bounded by the spine. In a book drawing, two edges
cross if and only if they are assigned to the same page and their vertices
alternate along the spine. Crossing minimization in a $k$-page book drawing is
NP-hard, yet book drawings have multiple applications in visualization and
beyond. Therefore several heuristic book drawing algorithms exist, but there is
no broader comparative study on their relative performance. In this paper, we
propose a comprehensive benchmark set of challenging graph classes for book
drawing algorithms and provide an extensive experimental study of the
performance of existing book drawing algorithms.
