11 citations · 13 across the 5 of their papers we have counts for
8 papers
Simultaneous Embedding of Two Paths on the Grid
Stephen Kobourov, William Lenhart, Giuseppe Liotta +3
Simultaneous geometric embedding of graphs on an integer grid is a classical research topic in Graph Drawing. When the graphs are two paths, one can additionally require that one p…
Mutual Witness Proximity Drawings of Isomorphic Trees
Carolina Haase, Philipp Kindermann, William J. Lenhart +1
A pair of graphs admits a mutual witness proximity drawing when: (i) represents , and (ii) there is an edge …
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
Mutual Witness Gabriel Drawings of Complete Bipartite Graphs
William J. Lenhart, Giuseppe Liotta
Let be a straight-line drawing of a graph and let and be two vertices of . The Gabriel disk of is the disk having and as antipodal points. A pair $\lan…
Packing Trees into 1-planar Graphs
Felice De Luca, Emilio Di Giacomo, Seok-Hee Hong +6
We introduce and study the 1-planar packing problem: Given graphs with vertices , find a 1-planar graph that contains the given graphs as edge-disjoint spa…
(k,p)-Planarity: A Relaxation of Hybrid Planarity
Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta +2
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph is -planar if can be partitioned into clusters of size at m…
On the Edge-length Ratio of Outerplanar Graphs
Sylvain Lazard, William Lenhart, Giuseppe Liotta
We show that any outerplanar graph admits a planar straightline drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. This result is tigh…
On Partitioning the Edges of 1-Plane Graphs
William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani
A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density. A red-blue edge coloring of…