dblp.uni-trier.dewww.uni-trier.de

Umberto Nanni

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2003
36EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1): 86-113 (2003)
35EESerafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003)
2001
34 Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM Journal of Experimental Algorithmics 6: 9 (2001)
33EEMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan: Characterization results of all shortest paths interval routing schemes. Networks 37(4): 225-232 (2001)
32EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001)
2000
31EECamil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. Algorithm Engineering 2000: 218-229
30 Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257
29 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000)
1998
28EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA 1998: 320-331
27EEDaniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380
26EEGiorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni: Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16
25 Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan: Characterization results of all shortest paths interval routing schemes. SIROCCO 1998: 201-213
24EEDaniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale: Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM Journal of Experimental Algorithmics 3: 5 (1998)
23EEDaniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998)
22EESerafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese: A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203(1): 69-90 (1998)
21EEMichele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan: Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205(1-2): 115-133 (1998)
1997
20EEPaolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni: The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. Inf. Process. Lett. 61(2): 113-120 (1997)
1996
19 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA 1996: 212-221
18 Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese: Counting Edges in a Dag. WG 1996: 85-100
17EEAlberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59(1): 53-58 (1996)
1995
16 Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan: Multi-Dimensional Interval Routing Schemes. WDAG 1995: 131-144
1994
15 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151
14 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
13 Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124
1993
12 Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert: On-line Graph Algorithms for Incremental Compilation. WG 1993: 70-86
11 Umberto Nanni, Silvio Salza, Mario Terranova: LOA: The LOGIDATA+ Object Algebra. LOGIDATA+: Deductive Databases with Complex Objects 1993: 195-210
10 Umberto Nanni, Silvio Salza, Mario Terranova: The LOGIDATA+ Prototype System. LOGIDATA+: Deductive Databases with Complex Objects 1993: 211-232
9 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
8 Paola Alimonti, Esteban Feuerstein, Umberto Nanni: Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. LATIN 1992: 1-14
7 Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95(2): 245-261 (1992)
1991
6 Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni: Competitive Algorithms for the Weighted List Update Problem. WADS 1991: 240-248
5 Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991)
1990
4 Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21
3 Giorgio Ausiello, Umberto Nanni: Dynamic Maintenance of Directed Hypergraphs. Theor. Comput. Sci. 72(2&3): 97-117 (1990)
1989
2 Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS 1989: 352-372
1988
1 Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC 1988: 1-12

Coauthor Index

1Paola Alimonti [8]
2Giorgio Ausiello [1] [3] [4] [5] [7] [26]
3Serafino Cicerone [18] [22] [30] [35]
4Camil Demetrescu [31]
5Esteban Feuerstein [8]
6Michele Flammini [16] [21] [25] [33]
7Paolo Giulio Franciosa [14] [20]
8Daniele Frigioni [13] [15] [18] [19] [22] [23] [24] [27] [28] [29] [30] [31] [32] [34] [35] [36]
9Giorgio Gambosi [14] [16] [20] [21] [25] [33]
10Mario Ioffreda [24]
11Giuseppe F. Italiano [2] [4] [5] [7] [26]
12Alberto Marchetti-Spaccamela [1] [2] [4] [5] [6] [7] [9] [12] [13] [15] [17] [19] [23] [28] [29] [31] [32] [36]
13Tobias Miller [27] [34]
14Giulio Pasquale [24]
15Giulio Pasqualone [27]
16Francesco Pugliese [18] [22]
17Hans Rohnert [12] [17]
18Silvio Salza [10] [11]
19Guido Schäfer [27]
20Gabriele Di Stefano [30] [35]
21Richard B. Tan [16] [21] [25] [33]
22Mario Terranova [10] [11]
23Christos D. Zaroliagis [27] [34]
24Fabrizio d'Amore [6] [9]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)