Paolo Giulio Franciosa

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 22

Top Topics

Top Venues

Discret. Appl. Math.

Publications

Lorenzo Balzotti, Paolo Giulio Franciosa
How vulnerable is an undirected planar graph with respect to max flow. Networks 83 (3) (2024)
Lorenzo Balzotti, Paolo Giulio Franciosa
Non-crossing shortest paths lengths in planar graphs in linear time. Discret. Appl. Math. 346 (2024)
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Mikhail N. Vyalyi
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. Int. J. Game Theory 53 (2) (2024)
Lorenzo Balzotti, Paolo Giulio Franciosa
Max Flow Vulnerability of Undirected Planar Networks. SEBD (2024)
Lorenzo Balzotti, Paolo Giulio Franciosa
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. CIAC (2023)
Nicola Apollonio, Daniel Blankenberg, Fabio Cumbo, Paolo Giulio Franciosa, Daniele Santoni
(HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks. Bioinform. 39 (1) (2023)
Lorenzo Balzotti, Paolo Giulio Franciosa
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. CIAC (2023)
Lorenzo Balzotti, Paolo Giulio Franciosa
Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs. CoRR (2022)
Lorenzo Balzotti, Paolo Giulio Franciosa
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. J. Graph Algorithms Appl. 26 (1) (2022)
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 (2022)
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
A tight relation between series-parallel graphs and bipartite distance hereditary graphs. Art Discret. Appl. Math. 5 (1) (2022)
Endre Boros, Paolo Giulio Franciosa, Vladimir Gurvich, Michael N. Vyalyi
Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies. CoRR (2022)
Lorenzo Balzotti, Paolo Giulio Franciosa
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. CSR (2022)
Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni
On function homophily of microbial Protein-Protein Interaction Networks. CoRR (2021)
Lorenzo Balzotti, Paolo Giulio Franciosa
Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time. CoRR (2021)
Lorenzo Balzotti, Paolo Giulio Franciosa
Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs. CoRR (2020)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max-flow vitality in undirected unweighted planar graphs. CoRR (2020)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max flow vitality in general and st-planar graphs. Networks 74 (1) (2019)
Fabrizio d'Amore, Paolo Giulio Franciosa
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs. Int. J. Comput. Geom. Appl. 28 (3) (2018)
Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini
Max flow vitality in general and planar graphs. CoRR (2017)
Nicola Apollonio, Paolo Giulio Franciosa
On computing the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 226 (2017)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
On Resilient Graph Spanners. Algorithmica 74 (4) (2016)
Nicola Apollonio, Paolo Giulio Franciosa
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR (2015)
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
On the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. (2015)
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs. CoRR (2015)
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
On the Galois Lattice of Bipartite Distance Hereditary Graphs. IWOCA (2014)
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa
On the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR (2014)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
On Robust Graph Spanners CoRR (2013)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini
On Resilient Graph Spanners. ESA (2013)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON (2010)
Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. 2 (4) (2010)
Nicola Apollonio, Paolo Giulio Franciosa
On the complexity of recognizing directed path families. Discret. Appl. Math. 157 (11) (2009)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55 (2) (2009)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410 (36) (2009)
Nicola Apollonio, Paolo Giulio Franciosa
A characterization of partial directed line graphs. Discret. Math. 307 (21) (2007)
Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA (2007)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10 (2) (2006)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3 (1) (2005)
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano
Small Stretch Spanners on Dynamic Graphs. ESA (2005)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS (2001)
Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250 (1-2) (2001)
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61 (2) (2000)
Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA (1998)
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
Efficient Searching with Linear Constraints. PODS (1998)
Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
Maintaining Maxima under Boundary Updates. CIAC (1997)
Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. Inf. Process. Lett. 61 (2) (1997)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC (1997)
Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS (1997)
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer
Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21 (3) (1996)
Paolo Giulio Franciosa, Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo
A convex hull algorithm for points with approximately known positions. Int. J. Comput. Geom. Appl. 4 (2) (1994)
Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. ESA (1994)
Paolo Giulio Franciosa, Maurizio Talamo
-sets and Fast Halfplane Search on Paged Memory. ORDAL (1994)
Paolo Giulio Franciosa, Maurizio Talamo
ESPRIT Project EP6881 AMUSING. IEEE Data Eng. Bull. 16 (3) (1993)
Fabrizio d'Amore, Paolo Giulio Franciosa
Separating sets of hyperrectangles. Int. J. Comput. Geom. Appl. 3 (2) (1993)
Fabrizio d'Amore, Paolo Giulio Franciosa
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. Inf. Process. Lett. 44 (5) (1992)
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer
Enclosing Many Boxes by an Optimal Pair of Boxes. STACS (1992)
Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry (1991)
Fabrizio d'Amore, Paolo Giulio Franciosa
Separating Sets of Hyperrectangles. MFCS (1990)