13 citations · 21 across the 8 of their papers we have counts for
10 papers
The Parametrized Complexity of the Segment Number
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…
Small Point-Sets Supporting Graph Stories
Giuseppe Di Battista, Walter Didimo, Luca Grilli +4
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time , called viewing window. At any time, the user can see…
Greedy Rectilinear Drawings
Patrizio Angelini, Michael A. Bekos, Walter Didimo +6
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vert…
Gap-planar Graphs
Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8
We introduce the family of -gap-planar graphs for , i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge…
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols +3
We consider edge insertion and deletion operations that increase the connectivity of a given planar straight-line graph (PSLG), while minimizing the total edge length of the output…
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…
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…
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…
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo +5
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the…
Statistical characterization of the fixed income market efficiency
M. Bernaschi, L. Grilli, L. Marangio +2
We present cross and time series analysis of price fluctuations in the U.S. Treasury fixed income market. By means of techniques borrowed from statistical physics we show that the…