|
Search the dblp DataBase
Umberto Nanni:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Counting Edges in a Dag. [Citation Graph (0, 0)][DBLP] WG, 1996, pp:85-100 [Conf]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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.004secs, Finished in 0.006secs
|