Pubblicazioni di Nanni Umberto
2003
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Nanni Umberto
A fully dynamic algorithm for distributed shortest paths. THEORETICAL COMPUTER SCIENCE 2003: 83-102
Frigioni D, MARCHETTI SPACCAMELA Alberto, Nanni Umberto
Fully dynamic shortest paths in diagraphs with arbitrary arc weights. JOURNAL OF ALGORITHMS 2003: 86-113
2001
Frigioni D., Miller T., Nanni Umberto, Zaroliagis C.
An experimental study of dynamic algorithms for transitive closure. ACM JOURNAL OF EXPERIMENTAL ALGORITHMICS 2001: 1-42
M. Flammini, G. Gambosi, Nanni Umberto, R. B. Tan
Characterization results of all shortest paths interval routing schemes. NETWORKS 2001: 225-232
Daniele Frigioni, Alberto Marchetti Spaccamela, Nanni Umberto
Dynamic algorithms for classes of constraint satisfaction problems. THEORETICAL COMPUTER SCIENCE 2001: 287-305
Lauretti S., Nanni Umberto, Guagnelli F., Ortolani G., D'Onofrio M., Urso A., Alexander R., Amici A.
Il Data Mining nella Analisi dei Database Oncologici: Studio Multicentrico nel Carcinoma della Vescica. 74° Congresso SIU - Società Italiana di Urologia 2001: -
Demetrescu Camil, Frigioni Daniele, Nanni Umberto, MARCHETTI SPACCAMELA Alberto
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. 4th Workshop on Algorithm Engineering (WAE) 2001: 218-229
A. Bertocchi, G. Bracco, G. Buceti, C. Centioli, F. Iannone, G. Manduchi, Nanni Umberto, M. Panella, C. Stracuzzi, V. Vitale
Recent developments and object-oriented approach in FTU database. FUSION ENGINEERING AND DESIGN 2001: 981-986
2000
D. Frigioni, MARCHETTI SPACCAMELA Alberto, Nanni Umberto
Fully Dynamic output bounded single source shortest path. JOURNAL OF ALGORITHMS 2000: 351-381