This is the arXiv index for the electronic proceedings of GD 2023, which...
A RAC graph is one admitting a RAC drawing, that is, a polyline drawing ...
Several types of linear layouts of graphs are obtained by leveraging kno...
Bipartite graphs model the relationships between two disjoint sets of
en...
We continue the study of linear layouts of graphs in relation to known d...
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
Strictly-convex straight-line drawings of 3-connected planar graphs in
s...
Motivated by cognitive experiments providing evidence that large
crossin...
A map graph is a graph admitting a representation in which vertices are
...
We continue the study of the area requirement of convex straight-line gr...
Graph product structure theory expresses certain graphs as subgraphs of ...
A linear layout of a graph typically consists of a total vertex order, a...
A k-queue layout is a special type of a linear layout, in which the line...
Computing a morph between two drawings of a graph is a classical problem...
A mixed s-stack q-queue layout of a graph consists of a linear order of ...
We investigate the queue number of posets in terms of their width, that ...
An interesting class of orthogonal representations consists of the so-ca...
We study the algorithmic problem of computing drawings of graphs in whic...
An embedding of a graph in a book consists of a linear order of its vert...
We present a prototype online system to automate the procedure of comput...
An embedding of a graph in a book, called book embedding, consists of a
...
In this work, we continue the study of vertex colorings of graphs, in wh...
Lovász conjectured that every connected 4-regular planar graph G admits ...
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no
k p...
Beyond-planarity focuses on combinatorial properties of classes of non-p...
External labeling is frequently used for annotating features in graphica...
A queue layout of a graph consists of a linear order of its vertices and...
A queue layout of a graph G consists of a linear order of the vertices o...
The crossing resolution of a non-planar drawing of a graph is the value ...
A k-bend right-angle-crossing drawing or (k-bend RAC drawing, for short)...
A drawing of a graph is greedy if for each ordered pair of vertices u an...
In a dispersable book embedding, the vertices of a given graph G must be...
We prove that every set S of Δ slopes containing the
horizontal slope i...
Beyond-planarity focuses on the study of geometric and topological graph...
We prove that every 1-planar graph G has a z-parallel visibility
represe...