| 2010 |
|---|
| 28 | Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. COCOON 2010, 160-172. Web SearchBibTeXDownload |
| 2009 |
|---|
| 27 | Graph Spanners in the Streaming Model: An Experimental Study. Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. Algorithmica (55): 346-374 (2009). Web SearchBibTeXDownload |
| 26 | On the complexity of recognizing directed path families. Nicola Apollonio, Paolo Giulio Franciosa. Discrete Applied Mathematics (157): 2525-2535 (2009). Web SearchBibTeXDownload |
| 25 | Small stretch (alpha, beta)-spanners in the streaming model. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano. Theor. Comput. Sci. (410): 3406-3413 (2009). Web SearchBibTeXDownload |
| 2007 |
|---|
| 24 | A characterization of partial directed line graphs. Nicola Apollonio, Paolo Giulio Franciosa. Discrete Mathematics (307): 2598-2614 (2007). Web SearchBibTeXDownload |
| 23 | Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. ESA 2007, 605-617. Web SearchBibTeXDownload |
| 2006 |
|---|
| 22 | Small Stretch Spanners on Dynamic Graphs. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano. J. Graph Algorithms Appl. (10): 365-385 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 21 | Small Stretch Spanners on Dynamic Graphs. Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano. ESA 2005, 532-543. Web SearchBibTeXDownload |
| 20 | Partially dynamic maintenance of minimum weight hyperpaths. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni. J. Discrete Algorithms (3): 27-46 (2005). Web SearchBibTeXDownload |
| 2001 |
|---|
| 19 | Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni. ICTCS 2001, 312-327. Web SearchBibTeXDownload |
| 18 | Semi-dynamic breadth-first search in digraphs. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. Theor. Comput. Sci. (250): 201-217 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 17 | Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. J. Comput. Syst. Sci. (61): 194-216 (2000). Cited by 82Web SearchBibTeXDownload |
| 1998 |
|---|
| 16 | Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract). Fabrizio d'Amore, Paolo Giulio Franciosa, Giuseppe Liotta. ESA 1998, 175-186. Web SearchBibTeXDownload |
| 15 | Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. PODS 1998, 169-178. Cited by 82Web SearchBibTeX |
| 1997 |
|---|
| 14 | Maintaining Maxima under Boundary Updates. Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo. CIAC 1997, 100-109. Web SearchBibTeXDownload |
| 13 | The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni. Inf. Process. Lett. (61): 113-120 (1997). Web SearchBibTeXDownload |
| 12 | Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. ISAAC 1997, 122-131. Web SearchBibTeXDownload |
| 11 | Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. STACS 1997, 33-46. Web SearchBibTeXDownload |
| 1996 |
|---|
| 10 | Enclosing a Set of Objects by Two Minimum Area Rectangles. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Stefano Leonardi, Thomas Ohler, Peter Widmayer. J. Algorithms (21): 520-541 (1996). Web SearchBibTeXDownload |
| 1994 |
|---|
| 9 | On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's. Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni. ESA 1994, 343-353. Web SearchBibTeXDownload |
| 8 | A convex hull algorithm for points with approximately known positions. Paolo Giulio Franciosa, Carlo Gaibisso, Giorgio Gambosi, Maurizio Talamo. Int. J. Comput. Geometry Appl. (4): 153-163 (1994). Web SearchBibTeX |
| 7 | Orders, k-sets and Fast Halfplane Search on Paged Memory. Paolo Giulio Franciosa, Maurizio Talamo. ORDAL 1994, 117-127. Web SearchBibTeXDownload |
| 1993 |
|---|
| 6 | ESPRIT Project EP6881 AMUSING. Paolo Giulio Franciosa, Maurizio Talamo. IEEE Data Eng. Bull. (16): 46-50 (1993). Web SearchBibTeX |
| 5 | Separating sets of hyperrectangles. Fabrizio d'Amore, Paolo Giulio Franciosa. Int. J. Comput. Geometry Appl. (3): 155-165 (1993). Web SearchBibTeX |
| 1992 |
|---|
| 4 | On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. Fabrizio d'Amore, Paolo Giulio Franciosa. Inf. Process. Lett. (44): 255-259 (1992). Web SearchBibTeXDownload |
| 3 | Enclosing Many Boxes by an Optimal Pair of Boxes. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer. STACS 1992, 475-486. Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Bruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer. Workshop on Computational Geometry 1991, 13-25. Web SearchBibTeXDownload |
| 1990 |
|---|
| 1 | Separating Sets of Hyperrectangles. Fabrizio d'Amore, Paolo Giulio Franciosa. MFCS 1990, 165-172. Web SearchBibTeXDownload |
