Lorenzo Balzotti

According to our database, Lorenzo Balzotti authored at least 15 papers between 2019 and 2024.

Collaborative distances:

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

2024

How vulnerable is an undirected planar graph with respect to max flow.

Lorenzo Balzotti, Paolo Giulio Franciosa

Networks, April, 2024

Non-crossing shortest paths lengths in planar graphs in linear time.

Lorenzo Balzotti, Paolo Giulio Franciosa

Discret. Appl. Math., 2024

Max Flow Vulnerability of Undirected Planar Networks.

Lorenzo Balzotti, Paolo Giulio Franciosa

Proceedings of the 32nd Symposium of Advanced Database Systems, 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, Schahram Dustdar, Thijs Metsch, Valerio Frascolla, Ahmed Khalid, Giada Landi, Juan Brenes, Ioan Toma, Róbert Szabó, Christian Schaefer, Seonghyun Kim, Cosmin Udroiu, Alexandre Ulisses, Verena Pietsch, Sigmund Akselsen, Arne Munch-Ellingsen, Irena Pavlova, Dessislava Petrova-Antonova, Hong-Gee Kim, Changsoo Kim, Bob Allen, Sunwoo Kim, Paulson Eberechukwu

Proceedings of the Companion Proceedings of the 8th International Joint Conference on Rules and Reasoning co-located with 20th Reasoning Web Summer School (RW 2024) and 16th DecisionCAMP 2024 as part of Declarative AI 2024, 2024

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, Schahram Dustdar, Thijs Metsch, Valerio Frascolla, Ahmed Khalid, Giada Landi, Juan Brenes, Ioan Toma, Róbert Szabó, Christian Schaefer, Cosmin Udroiu, Alexandre Ulisses, Verena Pietsch, Sigmund Akselsen, Arne Munch-Ellingsen, Irena Pavlova, Hong-Gee Kim, Changsoo Kim, Bob Allen, Sunwoo Kim, Paulson Eberechukwu

Proceedings of the Research Projects Exhibition Papers Presented at the 36th International Conference on Advanced Information Systems Engineering(CAiSE 2024), 2024

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

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