1 citations · 1 across the 16 of their papers we have counts for
7 papers · 1 filter
Planar Graphs of Bounded Degree have Constant Queue Number
Michael A. Bekos, Henry Förster, Martin Gronemann +4
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same que…
Polyline Drawings with Topological Constraints
Emilio Di Giacomo, Peter Eades, Giuseppe Liotta +2
Let be a simple topological graph and let be a polyline drawing of . We say that \emph{partially preserves the topology} of if it has the same external boundary,…
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Philipp Kindermann, Fabrizio Montecchiani, Lena Schlipf +1
We show that the 1-planar slope number of 3-connected cubic 1-planar graphs is at most 4 when edges are drawn as polygonal curves with at most 1 bend each. This bound is obtained b…
Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs
Giuseppe Liotta, Fabrizio Montecchiani, Alessandra Tappini
An ortho-polygon visibility representation of a -plane graph (OPVR of ) is an embedding preserving drawing that maps each vertex of to a distinct orthogonal polyg…
A Survey on Graph Drawing Beyond Planarity
Walter Didimo, Giuseppe Liotta, Fabrizio Montecchiani
Graph Drawing Beyond Planarity is a rapidly growing research area that classifies and studies geometric representations of non-planar graphs in terms of forbidden crossing configur…
Geodesic Obstacle Representation of Graphs
Prosenjit Bose, Paz Carmi, Vida Dujmovic +4
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-li…