Salta al contenuto principale
Ricerc@Sapienza
Toggle navigation
Home
Login
Home
Persone
paolo.franciosa@uniroma1.it
Paolo Giulio Franciosa
Professore Ordinario
Struttura:
DIPARTIMENTO DI SCIENZE STATISTICHE
E-mail:
paolo.franciosa@uniroma1.it
Pagina istituzionale corsi di laurea
Curriculum Sapienza
Pubblicazioni
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
Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks
BIOINFORMATICS
2023
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
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
INTERNATIONAL JOURNAL OF GAME THEORY
2023
Network homophily via tail inequalities
PHYSICAL REVIEW. E
2023
A novel method for assessing and measuring homophily in networks through second-order statistics
SCIENTIFIC REPORTS
2022
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
A tight relation between series--parallel graphs and bipartite distance hereditary graphs
THE ART OF DISCRETE AND APPLIED MATHEMATICS
2021
Max flow vitality in general and st‐planar graphs
NETWORKS
2019
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS
2018
On computing the Galois lattice of Bipartite Distance Hereditary graphs
DISCRETE APPLIED MATHEMATICS
2017
On Resilient Graph Spanners
ALGORITHMICA
2016
On the Galois Lattice of Bipartite Distance Hereditary Graphs
DISCRETE APPLIED MATHEMATICS
2015
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma