2003 |
19 | EE | Fabrizio d'Amore,
Fabio Iacobini:
On-line algorithms for networks of temporal constraints.
J. Discrete Algorithms 1(3-4): 303-312 (2003) |
1999 |
18 | | Fabrizio d'Amore,
Roberto Giaccio:
Intersection Problems on Segments Under Boundary Updates with Application to Persistent Lists.
Int. J. Comput. Geometry Appl. 9(6): 553- (1999) |
1998 |
17 | EE | Fabrizio d'Amore,
Paolo Giulio Franciosa,
Giuseppe Liotta:
Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract).
ESA 1998: 175-186 |
16 | | Fabrizio d'Amore,
Roberto Giaccio:
Logical Data Partitioning in Bitemporal Databases.
IADT 1998: 320-327 |
1997 |
15 | | Fabrizio d'Amore,
Paolo Giulio Franciosa,
Alberto Marchetti-Spaccamela:
Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings
Springer 1997 |
14 | | Fabrizio d'Amore,
Paolo Giulio Franciosa,
Roberto Giaccio,
Maurizio Talamo:
Maintaining Maxima under Boundary Updates.
CIAC 1997: 100-109 |
13 | | 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.
Euro-Par 1997: 950-957 |
12 | | Fabrizio d'Amore,
Fabio Iacobini:
On-Line Algorithms for Networks of Temporal Constraints.
WG 1997: 144-156 |
1995 |
11 | | Fabrizio d'Amore,
Roberto Giaccio:
Incremental Hive Graph.
WG 1995: 49-61 |
10 | EE | Fabrizio d'Amore,
Viet Hai Nguyen,
Thomas Roos,
Peter Widmayer:
On Optimal Cuts of Hyperrectangles.
Computing 55(3): 191-206 (1995) |
9 | EE | Fabrizio d'Amore,
P. Kohler:
Asymptotically Sharp Error Estimates for Modified Compound Quadrature Formulae for Cauchy Principal Value Integrals.
Computing 55(3): 255-269 (1995) |
1994 |
8 | | Fabrizio d'Amore,
Vincenzo Liberatore:
The List Update Problem and the Retrieval of Sets.
Theor. Comput. Sci. 130(1): 101-123 (1994) |
1993 |
7 | | Fabrizio d'Amore,
Thomas Roos,
Peter Widmayer:
An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles.
ICCG 1993: 215-224 |
6 | | Fabrizio d'Amore,
Paolo Giulio Franciosa:
Separating sets of hyperrectangles.
Int. J. Comput. Geometry Appl. 3(2): 155-165 (1993) |
5 | | Fabrizio d'Amore,
Alberto Marchetti-Spaccamela,
Umberto Nanni:
The Weighted List Update Problem and the Lazy Adversary.
Theor. Comput. Sci. 108(2): 371-384 (1993) |
1992 |
4 | | Fabrizio d'Amore,
Vincenzo Liberatore:
The List Update Problem and the Retrieval of Sets.
SWAT 1992: 178-191 |
3 | | 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) |
1991 |
2 | | Fabrizio d'Amore,
Alberto Marchetti-Spaccamela,
Umberto Nanni:
Competitive Algorithms for the Weighted List Update Problem.
WADS 1991: 240-248 |
1990 |
1 | | Fabrizio d'Amore,
Paolo Giulio Franciosa:
Separating Sets of Hyperrectangles.
MFCS 1990: 165-172 |