The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Paolo Giulio Franciosa: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. [Citation Graph (, )][DBLP]


  25. Graph Spanners in the Streaming Model: An Experimental Study. [Citation Graph (, )][DBLP]


  26. On the complexity of recognizing directed path families. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002