In this survey/introductory article, we first present the basics of the field of Parameterized
Complexity, made accessible to readers without background on the subject. Afterwards, we …

Among the vast literature concerning graph drawing and graph theory, linear layouts of
graphs have been the subject of intense research over the years, both from a combinatorial …

An $\ell $-page stack layout (also known as an $\ell $-page book embedding) of a graph is a
linear order of the vertex set together with a partition of the edge set into $\ell $ stacks (or …

Given a graph G=(V, E) with a vertex ordering≺, the fixed-order book thickness problem asks
whether there is a page assignment σ such that<≺, σ> is a k-page book embedding of G …

A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book
thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that …

An h-queue layout of a graph G consists of a linear order of its vertices and a partition of its
edges into h queues, such that no two independent edges of the same queue nest. The …

We study the complexity of testing whether a biconnected graph G=(V, E) is planar with the
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

Book thickness for graphs forms a major theme in graph theory and has a broad application
in the fields of sorting permutations, fault tolerant VLSI design, parallel computing, and …

We study the complexity of testing whether a biconnected graph is planar with the additional
constraint that some cyclic orders of the edges incident to its vertices are allowed while …

Given k input graphs, where each pair with i≠ j shares the same graph G, the problem
Simultaneous Embedding With Fixed Edges (SEFE) asks whether there exists a planar …