Lorenzo Balzotti

According to our database, Lorenzo Balzotti authored at least 12 papers between 2019 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Two new characterizations of path graphs.

Nicola Apollonio, Lorenzo Balzotti

Discret. Math., December, 2023

Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs.

Lorenzo Balzotti

PhD thesis, 2023

How Vulnerable is an Undirected Planar Graph with Respect to Max Flow.

Lorenzo Balzotti, Paolo Giulio Franciosa

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time.

Lorenzo Balzotti, Paolo Giulio Franciosa

Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

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 are Covered with Exactly Four Forests.

Lorenzo Balzotti

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

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs.

Lorenzo Balzotti, Paolo Giulio Franciosa

CoRR, 2022

2021

Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time.

Lorenzo Balzotti, Paolo Giulio Franciosa

CoRR, 2021

2020

A New Algorithm to Recognize Path Graphs.

Lorenzo Balzotti

CoRR, 2020

Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs.

Lorenzo Balzotti, Paolo Giulio Franciosa

CoRR, 2020

2019

A New Characterization of Path Graphs.

Nicola Apollonio, Lorenzo Balzotti

CoRR, 2019