Paolo Giulio Franciosa

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