activity
20102026
most citedAn annotated bibliography on 1-planarity

96 citations · 329 across the 48 of their papers we have counts for

collaborators
Showing 2016Show all

7 papers · 1 filter

cs.DC2016

A Distributed Multilevel Force-directed Algorithm

Alessio Arleo, Walter Didimo, Giuseppe Liotta +1

The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs.…

cs.CG2016★ 3 cited

Visibility Representations of Boxes in 2.5 Dimensions

Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7

We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…

cs.DS2016

Placing Arrows in Directed Graph Drawings

Carla Binucci, Markus Chimani, Walter Didimo +2

We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced una…

cs.CG2016★ 4 cited

1-bend Upward Planar Drawings of SP-digraphs

Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

It is proved that every series-parallel digraph whose maximum vertex-degree is admits an upward planar drawing with at most one bend per edge such that each edge segment has on…

cs.CG2016★ 2 cited

1-Bend RAC Drawings of 1-Planar Graphs

Walter Didimo, Giuseppe Liotta, Saeed Mehrabi +1

A graph is 1-planar if it has a drawing where each edge is crossed at most once. A drawing is RAC (Right Angle Crossing) if the edges cross only at right angles. The relationships…

cs.DS2016★ 3 cited

A Distributed Force-Directed Algorithm on Giraph: Design and Experiments

Alessio Arleo, Walter Didimo, Giuseppe Liotta +1

In this paper we study the problem of designing a distributed graph visualization algorithm for large graphs. The algorithm must be simple to implement and the computing infrastruc…

cs.CG2016

Ortho-polygon Visibility Representations of Embedded Graphs

Emilio Di Giacomo, Walter Didimo, William S. Evans +4

An ortho-polygon visibility representation of an -vertex embedded graph (OPVR of ) is an embedding-preserving drawing of that maps every vertex to a distinct orthogon…