21 citations · 42 across the 10 of their papers we have counts for
14 papers
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…
Line and Plane Cover Numbers Revisited
Therese Biedl, Stefan Felsner, Henk Meijer +1
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph , the mini…
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,…
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich +2
We present a number of breakthroughs for coordinated motion planning, in which the objective is to reconfigure a swarm of labeled convex objects by a combination of parallel, conti…
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…
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…