13 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.CG2016
On the -hardness of GRacSim Drawing and k-SEFE Problems
Luca Grilli
We study the complexity of two problems in simultaneous graph drawing. The first problem, GRacSim Drawing, asks for finding a simultaneous geometric embedding of two graphs such th…
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.CG2014★ 13 cited
On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
Michael A. Bekos, Sabine Cornelsen, Luca Grilli +2
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed mor…