A RAC graph is one admitting a RAC drawing, that is, a polyline drawing ...
Bipartite graphs model the relationships between two disjoint sets of
en...
This is the arXiv index for the electronic proceedings of GD 2022, which...
Motivated by cognitive experiments providing evidence that large
crossin...
A map graph is a graph admitting a representation in which vertices are
...
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edg...
We consider the problem of drawing an outerplanar graph with n vertices
...
Computing a morph between two drawings of a graph is a classical problem...
Given a bipartite graph G=(V_b,V_r,E), the 2-Level Quasi-Planarity
probl...
A mixed s-stack q-queue layout of a graph consists of a linear order of ...
We study the planar orthogonal drawing style within the framework of par...
The 2-layer drawing model is a well-established paradigm to visualize
bi...
In a planar L-drawing of a directed graph (digraph) each edge e is
repre...
A simple topological graph is k-quasiplanar (k≥ 2) if it contains no
k p...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
Beyond-planarity focuses on combinatorial properties of classes of non-p...
We consider the problem of morphing between contact representations of a...
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...
Motivated by hybrid graph representations, we introduce and study the
fo...
In the classical Steiner tree problem, one is given an undirected, conne...
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...