Follow
Umberto Nanni
Title
Cited by
Cited by
Year
Fully dynamic algorithms for maintaining shortest paths trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Journal of Algorithms 34 (2), 251-281, 2000
2592000
Incremental algorithms for minimal length paths
G Ausiello, GF Italiano, AM Spaccamela, U Nanni
Journal of Algorithms 12 (4), 615-638, 1991
2311991
Standard preanalytical coding for biospecimens: defining the sample PREanalytical code
F Betsou, S Lehmann, G Ashton, M Barnes, EE Benson, D Coppola, ...
Cancer epidemiology, biomarkers & prevention 19 (4), 1004-1011, 2010
1782010
Standard preanalytical coding for biospecimens: review and implementation of the Sample PREanalytical Code (SPREC)
S Lehmann, F Guadagni, H Moore, G Ashton, M Barnes, E Benson, ...
Biopreservation and biobanking 10 (4), 366-374, 2012
1362012
Semidynamic algorithms for maintaining single-source shortest path trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithmica 22 (3), 250-274, 1998
1011998
Fully dynamic output bounded single source shortest path problem
D Frigioniyz, A Marchetti-Spaccamelaz, U Nanniz
891996
Experimental analysis of dynamic algorithms for the single source shortest paths problem
D Frigioni, M Ioffreda, U Nanni, G Pasqualone
Journal of Experimental Algorithmics (JEA) 3, 5-es, 1998
861998
Optimal traversal of directed hypergraphs
G Ausielloyz, R Giaccioy, GF Italianox, U Nanniyz
ICSI, Berkeley, CA, 1992
791992
Maintaining a topological order under edge insertions
A Marchetti-Spaccamela, U Nanni, H Rohnert
Information Processing Letters 59 (1), 53-58, 1996
761996
Risk assessment for venous thromboembolism in chemotherapy-treated ambulatory cancer patients: a machine learning approach
P Ferroni, FM Zanzotto, N Scarpato, S Riondino, U Nanni, M Roselli, ...
Medical Decision Making 37 (2), 234-242, 2017
652017
Dynamic maintenance of directed hypergraphs
G Ausiello, U Nanni, GF Italiano
Theoretical Computer Science 72 (2-3), 97-117, 1990
591990
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken …, 2001
512001
A fully dynamic algorithm for distributed shortest paths
S Cicerone, G Di Stefano, D Frigioni, U Nanni
Theoretical Computer Science 297 (1-3), 83-102, 2003
422003
Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithms—ESA’98: 6th Annual European Symposium Venice, Italy, August 24 …, 2002
412002
Incremental algorithms for the single-source shortest path problem
D Frigioni, A Marchetti-Spaccamela, U Nanni
Foundation of Software Technology and Theoretical Computer Science: 14th …, 1994
391994
CEBP Focus: Biomarkers and Biospecimens
F Betsou, S Lehmann, G Ashton, M Barnes, EE Benson, D Coppola, ...
Cancer Epidemiol Biomarkers Prev 19, 4, 2010
382010
Fully dynamic shortest paths in digraphs with arbitrary arc weights
D Frigioni, A Marchetti-Spaccamela, U Nanni
Journal of Algorithms 49 (1), 86-113, 2003
382003
An experimental study of dynamic algorithms for transitive closure
D Frigioni, T Miller, U Nanni, C Zaroliagis
Journal of Experimental Algorithmics (JEA) 6, 9-es, 2001
362001
On-line graph algorithms for incremental compilation
A Marchetti-Spaccamela, U Nanni, H Rohnert
Lecture Notes in Computer Science 790, 70-86, 1994
351994
Online maintenance of minimal directed hypergraphs
GF Italiano, U Nanni
351989
The system can't perform the operation now. Try again later.
Articles 1–20