Marco D'Elia

activity

20242026

collaborators

6 papers

cs.CG2026

Extending Biconnected Straight-Line Planar Drawings

Giordano Andreola, Susanna Caroppo, Giordano Da Lozzo +5

The Partial Drawing Extensibility problem, for short PDE, takes as input a triple $⟨ G, H, Γ_{H} ⟩$ , where $G$ is a planar graph, $H$ is a subgraph of $G$ , and $Γ_{H}$ is a st…

cs.SI2026

High-Modularity Graph Partitioning Through NLP Techniques and Maximal Clique Enumeration

Marco D'Elia, Irene Finocchi, Maurizio Patrignani

Natural Language Processing (NLP) provides highly effective tools for interpreting and handling human language, offering a broad spectrum of applications. In this paper, we address…

math.CO2026

On Large Induced Outerplanar Subgraphs in $2$ -Outerplanar Graphs

Marco D'Elia, Fabrizio Frati

Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$ -vertex $2$ -outerplane graph has a set of at least $2 n /3$ vertices that induces an outerpla…

cs.DS2025

Engineering Algorithms for $ℓ$ -Isolated Maximal Clique Enumeration

Marco D'Elia, Irene Finocchi, Maurizio Patrignani

Maximal cliques play a fundamental role in numerous application domains, where their enumeration can prove extremely useful. Yet their sheer number, even in sparse real-world graph…

math.CO2024

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

Marco D'Elia, Fabrizio Frati

In this paper, we study the following question. Let $G$ be a family of planar graphs and let $k \geq 3$ be an integer. What is the largest value $f_{k} (n)$ such that every $n…

cs.DS2024

Upward Pointset Embeddings of Planar st-Graphs

Carlos Alegria, Susanna Caroppo, Giordano Da Lozzo +5

We study upward pointset embeddings (UPSEs) of planar $s t$ -graphs. Let $G$ be a planar $s t$ -graph and let $S \subset R^{2}$ be a pointset with $∣ S ∣ = ∣ V (G) ∣$ . An UPSE of $G$ …