Paolo Giulio Franciosa

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: On Robust Graph Spanners. CoRR abs/1303.1559 (2013)

Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano: Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discrete Math., Alg. and Appl. 2(4): 591-606 (2010)

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini: Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172

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)

Nicola Apollonio, Paolo Giulio Franciosa: On the complexity of recognizing directed path families. Discrete Applied Mathematics 157(11): 2525-2535 (2009)

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)

Nicola Apollonio, Paolo Giulio Franciosa: A characterization of partial directed line graphs. Discrete Mathematics 307(21): 2598-2614 (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: 605-617

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano: Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10(2): 365-385 (2006)

Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni: Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3(1): 27-46 (2005)

Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano: Small Stretch Spanners on Dynamic Graphs. ESA 2005: 532-543

Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio: Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250(1-2): 201-217 (2001)

Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni: Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327

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)

Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta: Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). ESA 1998: 175-186

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter: Efficient Searching with Linear Constraints. PODS 1998: 169-178

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)

Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo: Maintaining Maxima under Boundary Updates. CIAC 1997: 100-109

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

Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio: Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS 1997: 33-46

Fabrizio d'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela (Eds.): 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

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)

Paolo Giulio Franciosa, Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo: A convex hull algorithm for points with approximately known positions. Int. J. Comput. Geometry Appl. 4(2): 153-163 (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: 343-353

Paolo Giulio Franciosa, Maurizio Talamo: Orders, k-sets and Fast Halfplane Search on Paged Memory. ORDAL 1994: 117-127

Paolo Giulio Franciosa, Maurizio Talamo: ESPRIT Project EP6881 AMUSING. IEEE Data Eng. Bull. 16(3): 46-50 (1993)

Fabrizio d'Amore, Paolo Giulio Franciosa: Separating sets of hyperrectangles. Int. J. Comput. Geometry Appl. 3(2): 155-165 (1993)

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)

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

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

Fabrizio d'Amore, Paolo Giulio Franciosa: Separating Sets of Hyperrectangles. MFCS 1990: 165-172