Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. - Marco D'Elia; Irene Finocchi; Maurizio Patrignani (AI*IA, 2023)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs. - Marco D'Elia; Fabrizio Frati (CoRR, 2024)

Maximal cliques summarization: Principles, problem classification, and algorithmic approaches. - Marco D'Elia; Irene Finocchi; Maurizio Patrignani (Comput. Sci. Rev., 2025)

Upward Pointset Embeddings of Planar st-Graphs. - Carlos Alegría-Galicia; Susanna Caroppo; Giordano Da Lozzo; Marco D'Elia; Giuseppe Di Battista; Fabrizio Frati; Fabrizio Grosso; Maurizio Patrignani (Algorithmica, 2025)