P. G. Franciosa

发表

Eecient Searching with Linear Constraints

P. Agarwal, J. Vitter, J. Erickson, 1997 .

SEPARATING SETS OF HYPERRECTANGLES (picture of)

P. G. Franciosa, Fabrizio d'Amore, 1993 .

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time

P. G. Franciosa, Lorenzo Balzotti, 2021, 2102.10892.

Efficient searching with linear constraints

Jeffrey Scott Vitter, Pankaj K. Agarwal, Jeff Erickson, 1998, PODS '98.

cient Searching with Linear Constraints

Pankaj K. Agarwal, Lars Arge, Je Erickson, 2022 .

Network homophily via tail inequalities

P. G. Franciosa, D. Santoni, N. Apollonio, 2022, 2208.01914.

How Vulnerable is an Undirected Planar Graph with Respect to Max Flow

P. G. Franciosa, Lorenzo Balzotti, 2022, CIAC.

Semi-dynamic breadth-first search in digraphs

Daniele Frigioni, Paolo Giulio Franciosa, Roberto Giaccio, 2001, Theor. Comput. Sci..

Evaluating homophily in networks via HONTO (HOmophily Network TOol): a case study of chromosomal interactions in human PPI networks

P. G. Franciosa, D. Blankenberg, D. Santoni, 2022, Bioinformatics.

A novel method for assessing and measuring homophily in networks through second-order statistics

P. G. Franciosa, D. Santoni, N. Apollonio, 2021, Scientific Reports.

Partially dynamic maintenance of minimum weight hyperpaths

Daniele Frigioni, Giorgio Ausiello, Paolo Giulio Franciosa, 2005, J. Discrete Algorithms.

Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach

Daniele Frigioni, Giorgio Ausiello, Paolo Giulio Franciosa, 2001, ICTCS.

Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae

Daniele Frigioni, Giorgio Ausiello, Paolo Giulio Franciosa, 1997, ISAAC.

On the Galois lattice of bipartite distance hereditary graphs

Massimiliano Caramia, Paolo Giulio Franciosa, Nicola Apollonio, 2014, Discret. Appl. Math..

On Resilient Graph Spanners

Giuseppe F. Italiano, Giorgio Ausiello, Paolo Giulio Franciosa, 2013, Algorithmica.

Efficient searching with linear constraints

Jeffrey Scott Vitter, Pankaj K. Agarwal, Jeff Erickson, 1998, J. Comput. Syst. Sci..

Eecient Searching with Linear Constraints

P. Agarwal, J. Vitter, J. Erickson, 1997 .

An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles

Peter Widmayer, Paolo Giulio Franciosa, Thomas Ohler, 1991, Workshop on Computational Geometry.

Max flow vitality in general and st‐planar graphs

Giorgio Ausiello, Paolo Giulio Franciosa, Andrea Ribichini, 2019, Networks.

Graph Spanners in the Streaming Model: An Experimental Study

Giuseppe F. Italiano, Giorgio Ausiello, Camil Demetrescu, 2009, Algorithmica.

A tight relation between series-parallel graphs and Bipartite Distance Hereditary graphs pdf

Massimiliano Caramia, Paolo Giulio Franciosa, Nicola Apollonio, 2015, Art Discret. Appl. Math..

Small Stretch Spanners on Dynamic Graphs

Giuseppe F. Italiano, Giorgio Ausiello, Paolo Giulio Franciosa, 2005, J. Graph Algorithms Appl..

A novel method for assessing and measuring homophily in networks Descriptive power of z-score arrays and comparisons of networks

P. G. Franciosa, D. Santoni, N. Apollonio, 2022 .

On function homophily of microbial Protein-Protein Interaction Networks pdf

Daniele Santoni, Paolo Giulio Franciosa, Nicola Apollonio, 2021, ArXiv.

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs

P. G. Franciosa, G. Ausiello, I. Lari, 2022, ArXiv.

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs

P. G. Franciosa, Lorenzo Balzotti, 2022, ArXiv.

Computing Lengths of Non-Crossing Shortest Paths in Planar Graphs

P. G. Franciosa, Lorenzo Balzotti, 2020, 2011.04047.

Multi-Terminal Shortest Paths in Unit-Weight Planar Graphs in Linear Time pdf

Paolo G. Franciosa, Lorenzo Balzotti, P. G. Franciosa, 2021, ArXiv.

Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time

P. G. Franciosa, Lorenzo Balzotti, 2021, CSR.

Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs

P. G. Franciosa, Lorenzo Balzotti, 2020, ArXiv.

Small stretch (alpha, beta)-spanners in the streaming model

Giuseppe F. Italiano, Giorgio Ausiello, Paolo Giulio Franciosa, 2009, Theor. Comput. Sci..

EÆcient Searching with Linear Constraints

J. Vitter, P. G. Franciosa, L. Arge, 1997 .

On computing the Galois lattice of bipartite distance hereditary graphs pdf

Paolo Giulio Franciosa, Nicola Apollonio, P. G. Franciosa, 2015, Discret. Appl. Math..

On the complexity of recognizing directed path families

Paolo Giulio Franciosa, Nicola Apollonio, P. G. Franciosa, 2009, Discret. Appl. Math..

Max flow vitality in general and planar graphs pdf

Giorgio Ausiello, Paolo Giulio Franciosa, Andrea Ribichini, 2017, ArXiv.

Network homophily via tail inequalities.

P. G. Franciosa, D. Santoni, N. Apollonio, 2022, Physical review. E.

A novel method for assessing and measuring homophily in networks through second-order statistics

P. G. Franciosa, D. Santoni, N. Apollonio, 2021, Scientific Reports.

Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

V. Gurvich, P. G. Franciosa, E. Boros, 2022, Int. J. Game Theory.

Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs

Daniele Frigioni, Paolo Giulio Franciosa, Roberto Giaccio, 1997, STACS.

On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles

Paolo Giulio Franciosa, Fabrizio d'Amore, P. G. Franciosa, 1992, Inf. Process. Lett..

Separating sets of hyperrectangles

Paolo Giulio Franciosa, Fabrizio d'Amore, P. G. Franciosa, 1990, Int. J. Comput. Geom. Appl..

A characterization of partial directed line graphs

Paolo Giulio Franciosa, Nicola Apollonio, P. G. Franciosa, 2007, Discret. Math..

Eecient Searching with Linear Constraints

P. G. Franciosa, L. Arge, P. Agarwal, 1999 .