1. Max flow vitality in general and st-planar graphs;Ausiello;Networks,2019
2. Non-crossing shortest paths are covered with exactly four forests;Balzotti,2022
3. Non-crossing shortest paths in undirected unweighted planar graphs in linear time;Balzotti;J. Graph Algorithms Appl.,2022
4. Non-crossing shortest paths in undirected unweighted planar graphs in linear time;Balzotti,2022
5. How vulnerable is an undirected planar graph with respect to max flow;Balzotti,2023