Lorenzo Balzotti
Assegnista di ricerca
E-mail:
| Titolo | Pubblicato in | Anno |
|---|---|---|
| How vulnerable is an undirected planar graph with respect to max flow | NETWORKS | 2024 |
| Non-crossing shortest paths lengths in planar graphs in linear time | DISCRETE APPLIED MATHEMATICS | 2024 |
| INTEND: Intent-Based Data Operation in the Computing Continuum | Proceedings of the Research Projects Exhibition Papers Presented at the 36th International Conference on Advanced Information Systems Engineering (CAiSE 2024) | 2024 |
| Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time | Algorithms and Complexity. CIAC 2023. Lecture Notes in Computer Science, vol 13898. Springer | 2023 |
| How Vulnerable is an Undirected Planar Graph with Respect to Max Flow | Algorithms and Complexity. CIAC 2023. Lecture Notes in Computer Science, vol 13898. Springer | 2023 |
| Two new characterizations of path graphs | DISCRETE MATHEMATICS | 2023 |
| Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time | Computer science - theory and applications - 17th international computer science symposium in Russia, {CSR} 2022, virtual event, June 29 - July 1, 2022, Proceedings | 2022 |
| Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time | JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS | 2022 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma