 | 
| |
Online DBLP entries are available for Paolo Giulio Franciosa and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
- 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,
Daniele Frigioni,
Roberto Giaccio:
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs.
STACS 1997: 33-46
- Paolo Giulio Franciosa,
Giorgio Gambosi,
Umberto Nanni:
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs.
IPL 61(2): 113-120 (1997)
- 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,
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:
ESPRIT Project EP6881 AMUSING.
Data Engineering Bulletin 16(3): 46-50 (1993)
- 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
- Fabrizio d'Amore,
Paolo Giulio Franciosa:
On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles.
IPL 44(5): 255-259 (1992)
- Fabrizio d'Amore,
Paolo Giulio Franciosa:
Separating Sets of Hyperrectangles.
MFCS 1990: 165-172
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
