6 papers
Navigating Posets with Few Maps
Stefan Felsner, JÄdrzej Hodor, Giacomo Ortali +1
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset is a…
Grounded String Representations of Series-Parallel Graphs without Transitive Edges
Sabine Cornelsen, Jan KratochvÃl, Miriam Münch +3
In a {\em grounded string representation} of a graph there is a horizontal line and each vertex is represented as a simple curve below with one end point on su…
On Planar Straight-Line Dominance Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista +3
We study the following question, which has been considered since the 90's: Does every -planar graph admit a planar straight-line dominance drawing? We show concrete evidence fo…
Unbent Collections of Orthogonal Drawings
Todor AntiÄ, Giuseppe Liotta, Tomáš MasaÅÃk +5
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we appl…
Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5
Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…
Optimal Orthogonal Drawings in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing Î of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are draw…