19 citations · 22 across the 4 of their papers we have counts for
6 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…
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…
Monotone Simultaneous Embeddings of Paths in R^d
David Bremner, Olivier Devillers, Marc Glisse +5
We study the following problem: Given paths that share the same vertex set, is there a simultaneous geometric embedding of these paths such that each individual drawing is mono…
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…
On the Planar Split Thickness of Graphs
David Eppstein, Philipp Kindermann, Stephen Kobourov +7
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest such that the graph is -spl…