PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nanni, Umberto"

Author of the publication

copydeleteadd this publication to your clipboard
Multidimensional Interval Routing Schemes.

, , , and . Theor. Comput. Sci., 205 (1-2): 115-133 (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Nanni, Umberto
add a person with the name Nanni, Umberto
 

Other publications of authors with the same name

Maintaining a Topological Order Under Edge Insertions., , and . Inf. Process. Lett., 59 (1): 53-58 (1996)On-Line Computation of Minimal and Maximal Length Paths., , , and . Theor. Comput. Sci., 95 (2): 245-261 (1992)Multi-Dimensional Interval Routing Schemes., , , and . WDAG, volume 972 of Lecture Notes in Computer Science, page 131-144. Springer, (1995)Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs., , , , and . ISCO, volume 7422 of Lecture Notes in Computer Science, page 1-14. Springer, (2012)Incremental Algorithms for the Single-Source Shortest Path Problem., , and . FSTTCS, volume 880 of Lecture Notes in Computer Science, page 113-124. Springer, (1994)Recommending Tasks in Online Judges., , , , , , and . MIS4TEL, volume 1007 of Advances in Intelligent Systems and Computing, page 129-136. Springer, (2019)Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees., , and . Algorithmica, 22 (3): 250-274 (1998)A Uniform Approach to Semi-Dynamic Problems on Digraphs., , , and . Theor. Comput. Sci., 203 (1): 69-90 (1998)An Experimental Study of Dynamic Algorithms for Transitive Closure., , , and . ACM Journal of Experimental Algorithmics, (2001)Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights., , and . ESA, volume 1461 of Lecture Notes in Computer Science, page 320-331. Springer, (1998)