The study of nonplanar drawings of graphs with restricted crossing
confi...
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...
A linear layout of a graph G consists of a linear order ≺ of the
vertice...
Bipartite graphs model the relationships between two disjoint sets of
en...
This paper studies a packing problem in the so-called beyond-planar
sett...
A graph is rectilinear planar if it admits a planar orthogonal drawing
w...
Motivated by cognitive experiments providing evidence that large
crossin...
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph ...
Graph product structure theory expresses certain graphs as subgraphs of ...
Entity relationship extraction envisions the automatic generation of sem...
We study the long-standing open problem of efficiently testing rectiline...
In the area of beyond-planar graphs, i.e. graphs that can be drawn with ...
A linear layout of a graph typically consists of a total vertex order, a...
Following an analysis of the advantages of SQL-based Machine Learning (M...
We investigate the queue number of posets in terms of their width, that ...
A plane graph is rectilinear planar if it admits an embedding-preserving...
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...
We show that every planar graph can be represented by a monotone topolog...
In this paper, we study fan-planar drawings that use h layers and are
pr...
In this work, we continue the study of vertex colorings of graphs, in wh...
Distributed machine learning training is one of the most common and impo...
We initiate the study of Simultaneous Graph Embedding with Fixed Edges i...
Beyond-planarity focuses on combinatorial properties of classes of non-p...
In this paper we experimentally analyze the convergence behavior of CoCo...
A queue layout of a graph G consists of a linear order of the vertices o...
While orthogonal drawings have a long history, smooth orthogonal drawing...
The crossing resolution of a non-planar drawing of a graph is the value ...
Let G be a multigraph with n vertices and e>4n edges, drawn in the
plane...
A k-bend right-angle-crossing drawing or (k-bend RAC drawing, for short)...
In a dispersable book embedding, the vertices of a given graph G must be...
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...