A New Characterization of Path Graphs. - Nicola Apollonio; Lorenzo Balzotti (CoRR, 2019)

Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs. - Lorenzo Balzotti; Paolo Giulio Franciosa (CoRR, 2020)

A New Algorithm to Recognize Path Graphs. - Lorenzo Balzotti (CoRR, 2020)

Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time. - Lorenzo Balzotti; Paolo Giulio Franciosa (CoRR, 2021)

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs. - Lorenzo Balzotti; Paolo Giulio Franciosa (CoRR, 2022)

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. - Giorgio Ausiello; Lorenzo Balzotti; Paolo Giulio Franciosa; Isabella Lari; Andrea Ribichini (CoRR, 2022)

Non-Crossing Shortest Paths are Covered with Exactly Four Forests. - Lorenzo Balzotti (CoRR, 2022)

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. - Lorenzo Balzotti; Paolo Giulio Franciosa (J. Graph Algorithms Appl., 2022)

Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs. - Lorenzo Balzotti (2023)

Two new characterizations of path graphs. - Nicola Apollonio; Lorenzo Balzotti (Discret. Math., 2023)

INTEND: Intent-Based Data Operation in the Computing Continuum. - Donatella Firmani; Francesco Leotta; Jerin George Mathew; Jacopo Rossi; Lorenzo Balzotti; Hui Song; Dumitru Roman; Rustem Dautov; Erik Johannes Husom; Sagar Sen; Vilija Balionyte-Merle; Andrea Morichetta 002; et al. (CAiSE Research Projects Exhibition, 2024)

INTEND: Human-Like Intelligence for Intent-Based Data Operations in the Cognitive Computing Continuum. - Rustem Dautov; Hui Song; Dumitru Roman; Erik Johannes Husom; Sagar Sen; Vilija Balionyte-Merle; Donatella Firmani; Francesco Leotta; Jerin George Mathew; Jacopo Rossi; Lorenzo Balzotti; Andrea Morichetta 002; et al. (RuleML+RR (Companion), 2024)

Max Flow Vulnerability of Undirected Planar Networks. - Lorenzo Balzotti; Paolo Giulio Franciosa (SEBD, 2024)

Non-crossing shortest paths lengths in planar graphs in linear time. - Lorenzo Balzotti; Paolo Giulio Franciosa (Discret. Appl. Math., 2024)

How vulnerable is an undirected planar graph with respect to max flow. - Lorenzo Balzotti; Paolo Giulio Franciosa (Networks, 2024)

R-Fairness: Assessing Fairness of Ranking in Subjective Data. - Lorenzo Balzotti; Donatella Firmani; Jerin George Mathew; Riccardo Torlone; Sihem Amer-Yahia (ACL (1), 2025)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs. - Lorenzo Balzotti (Discret. Math. Theor. Comput. Sci., 2025)