default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Balzotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Lorenzo Balzotti:
Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs. Sapienza University of Rome, Italy, 2023
Journal Articles
- 2024
- [j4]Lorenzo Balzotti
, Paolo Giulio Franciosa:
Non-crossing shortest paths lengths in planar graphs in linear time. Discret. Appl. Math. 346: 183-191 (2024) - [j3]Lorenzo Balzotti, Paolo Giulio Franciosa:
How vulnerable is an undirected planar graph with respect to max flow. Networks 83(3): 570-586 (2024) - 2023
- [j2]Nicola Apollonio, Lorenzo Balzotti:
Two new characterizations of path graphs. Discret. Math. 346(12): 113596 (2023) - 2022
- [j1]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. J. Graph Algorithms Appl. 26(1): 589-606 (2022)
Conference and Workshop Papers
- 2024
- [c5]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:
INTEND: Intent-Based Data Operation in the Computing Continuum. CAiSE Research Projects Exhibition 2024: 43-50 - [c4]Lorenzo Balzotti, Paolo Giulio Franciosa:
Max Flow Vulnerability of Undirected Planar Networks. SEBD 2024: 152-162 - 2023
- [c3]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. CIAC 2023: 67-81 - [c2]Lorenzo Balzotti, Paolo Giulio Franciosa:
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. CIAC 2023: 82-96 - 2022
- [c1]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. CSR 2022: 77-95
Informal and Other Publications
- 2022
- [i8]Lorenzo Balzotti, Paolo Giulio Franciosa:
Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs. CoRR abs/2201.13099 (2022) - [i7]Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. CoRR abs/2204.10568 (2022) - [i6]Nicola Apollonio, Lorenzo Balzotti:
Two New Characterizations of Path Graphs. CoRR abs/2208.01001 (2022) - [i5]Lorenzo Balzotti:
Non-Crossing Shortest Paths are Covered with Exactly Four Forests. CoRR abs/2210.13036 (2022) - 2021
- [i4]Lorenzo Balzotti, Paolo Giulio Franciosa:
Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time. CoRR abs/2102.10892 (2021) - 2020
- [i3]Lorenzo Balzotti, Paolo Giulio Franciosa:
Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs. CoRR abs/2011.04047 (2020) - [i2]Lorenzo Balzotti:
A New Algorithm to Recognize Path Graphs. CoRR abs/2012.08476 (2020) - 2019
- [i1]Nicola Apollonio, Lorenzo Balzotti:
A New Characterization of Path Graphs. CoRR abs/1911.09069 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
