default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaolo Giulio Franciosa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j26]Lorenzo Balzotti
, Paolo Giulio Franciosa:
Non-crossing shortest paths lengths in planar graphs in linear time. Discret. Appl. Math. 346: 183-191 (2024)- [j25]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): 449-473 (2024) - [j24]Lorenzo Balzotti, Paolo Giulio Franciosa:
How vulnerable is an undirected planar graph with respect to max flow. Networks 83(3): 570-586 (2024) - 2023
- [j23]Nicola Apollonio, Daniel Blankenberg, Fabio Cumbo, Paolo Giulio Franciosa, Daniele Santoni:
Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks. Bioinform. 39(1) (2023) - 2022
- [j22]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) - [j21]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. J. Graph Algorithms Appl. 26(1): 589-606 (2022) - 2019
- [j20]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and st-planar graphs. Networks 74(1): 70-78 (2019) - 2018
- [j19]Fabrizio d'Amore, Paolo Giulio Franciosa:
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs. Int. J. Comput. Geom. Appl. 28(3): 227-253 (2018) - 2017
- [j18]Nicola Apollonio, Paolo Giulio Franciosa:
On computing the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 226: 1-9 (2017) - 2016
- [j17]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Resilient Graph Spanners. Algorithmica 74(4): 1363-1385 (2016) - 2015
- [j16]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois lattice of bipartite distance hereditary graphs. Discret. Appl. Math. 190-191: 13-23 (2015) - 2010
- [j15]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): 591-606 (2010) - 2009
- [j14]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009) - [j13]Nicola Apollonio, Paolo Giulio Franciosa:
On the complexity of recognizing directed path families. Discret. Appl. Math. 157(11): 2525-2535 (2009) - [j12]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410(36): 3406-3413 (2009) - 2007
- [j11]Nicola Apollonio, Paolo Giulio Franciosa:
A characterization of partial directed line graphs. Discret. Math. 307(21): 2598-2614 (2007) - 2006
- [j10]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10(2): 365-385 (2006) - 2005
- [j9]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3(1): 27-46 (2005) - 2001
- [j8]Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250(1-2): 201-217 (2001) - 2000
- [j7]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints. J. Comput. Syst. Sci. 61(2): 194-216 (2000) - 1997
- [j6]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): 113-120 (1997) - 1996
- [j5]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): 520-541 (1996) - 1994
- [j4]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): 153-163 (1994) - 1993
- [j3]Paolo Giulio Franciosa, Maurizio Talamo:
ESPRIT Project EP6881 AMUSING. IEEE Data Eng. Bull. 16(3): 46-50 (1993) - [j2]Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating sets of hyperrectangles. Int. J. Comput. Geom. Appl. 3(2): 155-165 (1993) - 1992
- [j1]Fabrizio d'Amore, Paolo Giulio Franciosa:
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. Inf. Process. Lett. 44(5): 255-259 (1992)
Conference and Workshop Papers
- 2024
- [c20]Lorenzo Balzotti, Paolo Giulio Franciosa:
Max Flow Vulnerability of Undirected Planar Networks. SEBD 2024: 152-162 - 2023
- [c19]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time. CIAC 2023: 67-81 - [c18]Lorenzo Balzotti, Paolo Giulio Franciosa:
How Vulnerable is an Undirected Planar Graph with Respect to Max Flow. CIAC 2023: 82-96 - 2022
- [c17]Lorenzo Balzotti, Paolo Giulio Franciosa:
Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time. CSR 2022: 77-95 - 2014
- [c16]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. IWOCA 2014: 37-48 - 2013
- [c15]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - 2010
- [c14]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172 - 2007
- [c13]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: 605-617 - 2005
- [c12]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. ESA 2005: 532-543 - 2001
- [c11]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327 - 1998
- [c10]Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta:
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA 1998: 175-186 - [c9]Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter:
Efficient Searching with Linear Constraints. PODS 1998: 169-178 - 1997
- [c8]Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo:
Maintaining Maxima under Boundary Updates. CIAC 1997: 100-109 - [c7]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC 1997: 122-131 - [c6]Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS 1997: 33-46 - 1994
- [c5]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: 343-353 - [c4]Paolo Giulio Franciosa, Maurizio Talamo:
Orders, k-sets and Fast Halfplane Search on Paged Memory. ORDAL 1994: 117-127 - 1992
- [c3]Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer:
Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992: 475-486 - 1991
- [c2]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: 13-25 - 1990
- [c1]Fabrizio d'Amore, Paolo Giulio Franciosa:
Separating Sets of Hyperrectangles. MFCS 1990: 165-172
Editorship
- 1997
- [e1]Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela:
Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings. Lecture Notes in Computer Science 1197, Springer 1997, ISBN 3-540-62559-3 [contents]
Informal and Other Publications
- 2022
- [i12]Lorenzo Balzotti, Paolo Giulio Franciosa:
Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs. CoRR abs/2201.13099 (2022) - [i11]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 abs/2202.11554 (2022) - [i10]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 abs/2204.10568 (2022) - 2021
- [i9]Lorenzo Balzotti, Paolo Giulio Franciosa:
Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time. CoRR abs/2102.10892 (2021) - [i8]Nicola Apollonio, Paolo Giulio Franciosa, Daniele Santoni:
On function homophily of microbial Protein-Protein Interaction Networks. CoRR abs/2107.10037 (2021) - 2020
- [i7]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max-flow vitality in undirected unweighted planar graphs. CoRR abs/2011.02375 (2020) - [i6]Lorenzo Balzotti, Paolo Giulio Franciosa:
Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs. CoRR abs/2011.04047 (2020) - 2017
- [i5]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and planar graphs. CoRR abs/1710.01965 (2017) - 2015
- [i4]Nicola Apollonio, Paolo Giulio Franciosa:
On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR abs/1510.06883 (2015) - [i3]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa, Jean-François Mascari:
A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs. CoRR abs/1511.03100 (2015) - 2014
- [i2]Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa:
On the Galois Lattice of Bipartite Distance Hereditary Graphs. CoRR abs/1406.0154 (2014) - 2013
- [i1]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Robust Graph Spanners. CoRR abs/1303.1559 (2013)
Coauthor Index
aka: Giuseppe Francesco Italiano
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
