Marco D'Elia

works on

algorithmic complexity 1 biconnected graphs 1 fixed embedding 1 partial drawing extension 1 planar graphs 1

From the 1 of 6 linked papers with an AI index.

collaborators

Showing cs.DSShow all

2 papers · 1 filter

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…

cs.DS2025

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$ …

Engineering Algorithms for ℓ-Isolated Maximal Clique Enumeration

Upward Pointset Embeddings of Planar st-Graphs

Engineering Algorithms for $ℓ$ -Isolated Maximal Clique Enumeration