2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.CG2017★ 1 cited
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…
cs.DM2017
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…
cs.CG2012★ 2 cited
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…