Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Lorenzo Balzotti
Observed name:
Balzotti, Lorenzo
Institution:
Sapienza University of Rome
Observed institution:
Sapienza University of Rome
ORCID:
0000-0001-6191-9801
Observed ORCID:
0000-0001-6191-9801
OpenAlex ID:
A5025369365
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
2022
·
Lorenzo Balzotti
, Paolo G. Franciosa
·
Lecture notes in computer science
·
6
PDF
Non-Crossing Shortest Paths are Covered with Exactly Four Forests
2022
·
Balzotti, Lorenzo
·
arXiv (Cornell University)
·
5
PDF
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
2022
·
Lorenzo Balzotti
, Paolo Franciosa
·
Journal of Graph Algorithms and Applications
·
5
Interdiction in network maximum flow and related problems: A survey
2025
·
Giorgio Ausiello
, Lorenzo Balzotti
, et al.
·
Computer Science Review
·
4
Non-crossing shortest paths lengths in planar graphs in linear time
2023
·
Lorenzo Balzotti
, Paolo G. Franciosa
·
Discrete Applied Mathematics
·
4
Computing Lengths of Non-Crossing Shortest Paths in Planar Graphs
2020
·
Balzotti, Lorenzo
, Franciosa, Paolo G.
·
arXiv (Cornell University)
·
4
PDF
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow
2023
·
Lorenzo Balzotti
, Paolo G. Franciosa
·
Lecture notes in computer science
·
3
PDF
How vulnerable is an undirected planar graph with respect to max flow
2024
·
Lorenzo Balzotti
, Paolo G. Franciosa
·
Networks
·
2
PDF
Two new characterizations of path graphs
2023
·
Nicola Apollonio
, Lorenzo Balzotti
·
Discrete Mathematics
·
2
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
2022
·
Ausiello, Giorgio
, Balzotti, Lorenzo
, et al.
·
arXiv (Cornell University)
·
2
PDF
A New Algorithm to Recognize Path Graphs and Directed Path Graphs.
2020
·
Lorenzo Balzotti
·
arXiv (Cornell University)
·
2
Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs.
2020
·
Lorenzo Balzotti
, Paolo Giulio Franciosa
·
arXiv (Cornell University)
·
2
Entity Resolution via Batched Oracle Queries
2026
·
Balzotti, Lorenzo
, Firmani, Donatella
, et al.
·
arXiv (Cornell University)
·
1
PDF
R-Fairness: Assessing Fairness of Ranking in Subjective Data
2025
·
Lorenzo Balzotti
, Donatella Firmani
, et al.
·
Proceedings of the conference - Association for Computational Linguistics. Meeting
·
1
PDF
A New Characterization of Path Graphs
2019
·
Apollonio, Nicola
, Balzotti, Lorenzo
·
arXiv (Cornell University)
·
1
PDF
Towards Bringing Human-Like Intelligence in the Computing Continuum: the INTEND Project
2026
·
Balzotti, Lorenzo
, Firmani, Donatella
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
2025
·
Lorenzo Balzotti
·
Discrete Mathematics & Theoretical Computer Science
PDF
PUGMM: Parsimonious Ultrametric Gaussian Mixture Models
2024
·
Giorgia Zaccaria
, Carlo Cavicchia
, et al.
PDF
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time
2023
·
Lorenzo Balzotti
, Paolo G. Franciosa
·
Lecture notes in computer science
Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time
2022
·
Lorenzo Balzotti
, Paolo Giulio Franciosa
·
SSRN Electronic Journal
Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time.
2021
·
Lorenzo Balzotti
, Paolo Giulio Franciosa
·
arXiv (Cornell University)
A New Algorithm to Recognize Path Graphs.
2020
·
Lorenzo Balzotti
·
arXiv (Cornell University)
Show more works
View as search
Works count:
29
Citation count:
60
H-index:
4
I10-index:
1
Year
Topic
Type