96 citations · 329 across the 48 of their papers we have counts for
9 papers · 1 filter
GiViP: A Visual Profiler for Distributed Graph Processing Systems
Alessio Arleo, Walter Didimo, Giuseppe Liotta +1
Analyzing large-scale graphs provides valuable insights in different application scenarios. While many graph processing systems working on top of distributed infrastructures have b…
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…
Colored Point-set Embeddings of Acyclic Graphs
Emilio Di Giacomo, Leszek Gasieniec, Giuseppe Liotta +1
We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require edges each having $Ω(n^\fra…
NodeTrix Planarity Testing with Small Clusters
Emilio Di Giacomo, Giuseppe Liotta, Maurizio Patrignani +2
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant . We consider both the case when the sid…
Beyond Outerplanarity
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta +2
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes wit…
New Results on Edge Partitions of 1-plane Graphs
Emilio Di Giacomo, Walter Didimo, William S. Evans +4
A -plane graph is a graph embedded in the plane such that each edge is crossed at most once. A NIC-plane graph is a -plane graph such that any two pairs of crossing edges sha…
Universal Slope Sets for 1-Bend Planar Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Liotta +1
We describe a set of slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree ; this establishes a new upper bound of on the 1-b…
An annotated bibliography on 1-planarity
Stephen G. Kobourov, Giuseppe Liotta, Fabrizio Montecchiani
The notion of 1-planarity is among the most natural and most studied generalizations of graph planarity. A graph is 1-planar if it has an embedding where each edge is crossed by at…
On the Relationship between -Planar and -Quasi Planar Graphs
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg +6
A graph is -planar if it can be drawn in the plane such that no edge is crossed more than times. A graph is -quasi planar if it can be drawn in…