The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fabrizio d'Amore: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Fabrizio d'Amore, Luca Becchetti, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder
    On the Embedding of Refinements of 2-dimensional Grids. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:950-957 [Conf]
  5. Fabrizio d'Amore, Roberto Giaccio
    Logical Data Partitioning in Bitemporal Databases. [Citation Graph (0, 0)][DBLP]
    IADT, 1998, pp:320-327 [Conf]
  6. Fabrizio d'Amore, Thomas Roos, Peter Widmayer
    An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. [Citation Graph (0, 0)][DBLP]
    ICCG, 1993, pp:215-224 [Conf]
  7. Fabrizio d'Amore, Paolo Giulio Franciosa
    Separating Sets of Hyperrectangles. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:165-172 [Conf]
  8. Fabrizio d'Amore, Vincenzo Liberatore
    The List Update Problem and the Retrieval of Sets. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:178-191 [Conf]
  9. Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
    Competitive Algorithms for the Weighted List Update Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:240-248 [Conf]
  10. Fabrizio d'Amore, Roberto Giaccio
    Incremental Hive Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:49-61 [Conf]
  11. Fabrizio d'Amore, Fabio Iacobini
    On-Line Algorithms for Networks of Temporal Constraints. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:144-156 [Conf]
  12. Fabrizio d'Amore, P. Kohler
    Asymptotically Sharp Error Estimates for Modified Compound Quadrature Formulae for Cauchy Principal Value Integrals. [Citation Graph (0, 0)][DBLP]
    Computing, 1995, v:55, n:3, pp:255-269 [Journal]
  13. Fabrizio d'Amore, Viet Hai Nguyen, Thomas Roos, Peter Widmayer
    On Optimal Cuts of Hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Computing, 1995, v:55, n:3, pp:191-206 [Journal]
  14. 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]
  15. Fabrizio d'Amore, Roberto Giaccio
    Intersection Problems on Segments Under Boundary Updates with Application to Persistent Lists. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:6, pp:553-0 [Journal]
  16. Fabrizio d'Amore, Fabio Iacobini
    On-line algorithms for networks of temporal constraints. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:303-312 [Journal]
  17. Fabrizio d'Amore, Vincenzo Liberatore
    The List Update Problem and the Retrieval of Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:101-123 [Journal]
  18. Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
    The Weighted List Update Problem and the Lazy Adversary. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:2, pp:371-384 [Journal]

Search in 0.004secs, Finished in 0.006secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002