Felice De Luca

Felice De Luca

Auto-generated profile, based on publicly available information

Felice De Luca

University of Arizona

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020
Verified
Book Chapter
Closed access
PDF file
RAReyan Ahmed
Reyan Ahmed
FLFelice De Luca
Felice De Luca
SDSabin Devkota
Sabin Devkota
SKStephen Kobourov
Stephen Kobourov
MLMingwei Li
Mingwei Li

28 November 2019
Verified
Book Chapter
Closed access
PDF file
SDSabin Devkota
Sabin Devkota
RAReyan Ahmed
Reyan Ahmed
FLFelice De Luca
Felice De Luca
KIKatherine E. Isaacs
Katherine E. Isaacs
SKStephen Kobourov
Stephen Kobourov

28 November 2019
Verified
Book Chapter
Closed access
PDF file
FLFelice De Luca
Felice De Luca
IHIqbal Hossain
Iqbal Hossain
SKStephen Kobourov
Stephen Kobourov

5 November 2019 in arXiv
Verified
Preprint
Open access
PDF file
FLFelice De Luca
Felice De Luca
EGEmilio Di Giacomo
Emilio Di Giacomo
SHSeok-Hee Hong
Seok-Hee Hong
SKStephen Kobourov
Stephen Kobourov
WLWilliam Lenhart
William Lenhart
SWStephen Wismath
Stephen Wismath
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$ is a tree and $k=3$. We prove that a triple consisting of three caterpillars or of two caterpillars and a path may not admit a 1-planar packing, while two paths and a special type of caterpillar always have one. We then study 1-planar packings with few crossings and prove that three paths (resp. cycles) admit a 1-planar packing with at most seven (resp. fourteen) crossings. We finally show that a quadruple consisting of three paths and a perfect matching with $n \geq 12$ vertices admits a 1-planar packing, while such a packing does not exist if $n \leq 10$.

5 March 2017 in arXiv
Verified
Preprint
Open access
PDF file
AAAbu Reyan Ahmed
Abu Reyan Ahmed
FLFelice De Luca
Felice De Luca
SDSabin Devkota
Sabin Devkota
AEAlon Efrat
Alon Efrat
IHIqbal Hossain
Iqbal Hossain
EWEric Welch
Eric Welch
In an $\mathsf{L}$-embedding of a graph, each vertex is represented by an $\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each $\mathsf{L}$-segment in an $\mathsf{L}$-embedding lies on a straight line, we call it a monotone $\mathsf{L}$-embedding. In this paper we give a full characterization of monotone $\mathsf{L}$-embeddings by introducing a new class of graphs which we call "non-jumping" graphs. We show that a graph admits a monotone $\mathsf{L}$-embedding if and only if the graph is a non-jumping graph. Further, we show that outerplanar graphs, convex bipartite graphs, interval graphs, 3-leaf power graphs, and complete graphs are subclasses of non-jumping graphs. Finally, we show that distance-hereditary graphs and $k$-leaf power graphs ($k\le 4$) admit $\mathsf{L}$-embeddings.

20 February 2020
Verified
Book Chapter
Closed access
PDF file
FLFelice De Luca
Felice De Luca
EGEmilio Di Giacomo
Emilio Di Giacomo
SHSeok-Hee Hong
Seok-Hee Hong
SKStephen Kobourov
Stephen Kobourov
WLWilliam Lenhart
William Lenhart
SWStephen Wismath
Stephen Wismath