The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Umberto Nanni: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.025secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002