Partial edge drawings (PED) of graphs avoid edge crossings by subdividin...
We study two notions of fan-planarity introduced by (Cheong et al., GD22...
A linear layout of a graph G consists of a linear order ≺ of the
vertice...
In the area of beyond-planar graphs, i.e. graphs that can be drawn with ...
The 2-layer drawing model is a well-established paradigm to visualize
bi...
Motivated by the fact that in a space where shortest paths are unique, n...
We show that every planar graph can be represented by a monotone topolog...
In a RAC drawing of a graph, vertices are represented by points in the p...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
In this paper, we study arrangements of orthogonal circles, that is,
arr...
A queue layout of a graph consists of a linear order of its vertices and...
While orthogonal drawings have a long history, smooth orthogonal drawing...
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)...