4 citations · 9 across the 3 of their papers we have counts for
8 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…
Symmetry Detection and Classification in Drawings of Graphs
Felice De Luca, Md Iqbal Hossain, Stephen Kobourov
Symmetry is a key feature observed in nature (from flowers and leaves, to butterflies and birds) and in human-made objects (from paintings and sculptures, to manufactured objects a…
Stress-Plus-X (SPX) Graph Layout
Sabin Devkota, Reyan Ahmed, Felice De Luca +2
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these cr…
Multi-level tree based approach for interactive graph visualization with semantic zoom
Felice De Luca, Iqbal Hossain, Kathryn Gray +2
Human subject studies that map-like visualizations are as good or better than standard node-link representations of graphs, in terms of task performance, memorization and recall of…
Recognition and Drawing of Stick Graphs
Felice De Luca, Md Iqbal Hossain, Stephen Kobourov +2
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments l…
On Vertex- and Empty-Ply Proximity Drawings
Patrizio Angelini, Steven Chaplick, Felice De Luca +7
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equ…
Planar Drawings of Fixed-Mobile Bigraphs
Michael Bekos, Felice De Luca, Walter Didimo +4
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, tog…
L-Graphs and Monotone L-Graphs
Abu Reyan Ahmed, Felice De Luca, Sabin Devkota +6
In an -embedding of a graph, each vertex is represented by an -segment, and two segments intersect each other if and only if the corresponding vertices are…