Lorenzo Balzotti

MaRDI QIDQ2097215zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Simpler and unified recognition algorithm for path graphs and directed path graphs Discrete Mathematics and Theoretical Computer Science. DMTCS	2025-05-07	Paper
How vulnerable is an undirected planar graph with respect to max flow Networks	2024-03-15	Paper
Non-crossing shortest paths lengths in planar graphs in linear time Discrete Applied Mathematics	2024-02-14	Paper
Two new characterizations of path graphs Discrete Mathematics	2023-10-04	Paper
Non-crossing shortest paths lengths in planar graphs in linear time Lecture Notes in Computer Science	2023-10-04	Paper
How vulnerable is an undirected planar graph with respect to max flow Lecture Notes in Computer Science	2023-10-04	Paper
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time Journal of Graph Algorithms and Applications	2023-03-30	Paper
Non-crossing shortest paths in undirected unweighted planar graphs in linear time (available as arXiv preprint)	2022-11-11	Paper
Non-Crossing Shortest Paths are Covered with Exactly Four Forests	2022-10-24	Paper
A New Characterization of Path Graphs	2019-11-20	Paper

Research outcomes over time

This page was built for person: Lorenzo Balzotti