2 citations · 3 across the 4 of their papers we have counts for
6 papers · 1 filter
Quasi-upward Planar Drawings with Minimum Curve Complexity
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…
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…
Upward Book Embeddings of st-Graphs
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo +3
We study -page upward book embeddings (UBEs) of -graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on pages with the additional re…
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,…
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…
How many vertex locations can be arbitrarily chosen when drawing planar graphs?
Emilio Di Giacomo, Giuseppe Liotta, Tamara Mchedlidze
It is proven that every set of distinct points in the plane with cardinality can be a subset of the vertices of a crossing-free stra…