The approximate computation of twin-width has attracted significant attention already since
the moment the parameter was introduced. A recently proposed approach (STACS 2024) …

A linear layout of a graph G consists of a linear order,≺, of the vertices and a partition of the
edges. A part is called a queue (stack) if no two edges nest (cross), that is, two edges (v, w) …

This paper studies planar drawings of graphs in which each vertex is represented as a point
along a sequence of horizontal lines, called levels, and each edge is either a horizontal …

In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline
and edge crossings must occur at an angle of exactly 90∘, where the number of bends on …

The Linear Layout of Graphs problem asks, given a graph G and a positive integer k,
whether G admits a layout consisting of a linear ordering of its vertices and a partition of its …

We study the classical problem of computing geometric thickness, ie, finding a straight-line
drawing of an input graph and a partition of its edges into as few parts as possible so that …

Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line
segment. Given a planar graph G, the segment number of G is the minimum number of …

In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline
and edge crossings must occur at an angle of exactly $90^\circ $, where the number of …

Given an n-vertex graph G with a fixed linear ordering of V (G) and two integers k, b, the
problem fixed-order book drawing with few crossings per edge asks whether or not G admits …

Given a bipartite graph G=(T∪ B, E), the problem bipartite 1-sided vertex explosion is to
decide whether there exists a planar 2-layer embedding of G after exploding at most k …