Umberto Nanni

Publication Activity (10 Years)

Years Active: 1988-2021
Publications (10 Years): 3

Top Topics

Repositories Of Learning Objects

Visual Analysis

Top Venues

Publications

Paolo Fantozzi, Luigi Laura, Umberto Nanni, Alessandro Villa
Non-isomorphic CNF Generation. DCAI (1) (2021)
Giorgio Audrito, Tania Di Mascio, Paolo Fantozzi, Luigi Laura, Gemma Martini, Umberto Nanni, Marco Temperini
Recommending Tasks in Online Judges. MIS4TEL (2019)
Paolo Fantozzi, Luigi Laura, Umberto Nanni, Marco Temperini
Visual Analysis of Vertex-Disjoint Path Connectivity in Networks. IV (2018)
Luigi Laura, Umberto Nanni, Marco Temperini
Visual Analysis Based on Dominator Trees with Application to Personalized eLearning. ICWL (2014)
Luigi Laura, Umberto Nanni, Marco Temperini
The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs. ICWL Workshops (2014)
Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO (2012)
Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni
Linear time analysis of properties of conflict-free and general Petri nets. Theor. Comput. Sci. 412 (4-5) (2011)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49 (1) (2003)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297 (1-3) (2003)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259 (1-2) (2001)
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Characterization results of all shortest paths interval routing schemes. Networks 37 (4) (2001)
Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis
An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM J. Exp. Algorithmics 6 (2001)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN (2000)
Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE (2000)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34 (2) (2000)
Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA (1998)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA (1998)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22 (3) (1998)
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Characterization results of all shortest paths interval routing schemes. SIROCCO (1998)
Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM J. Exp. Algorithmics 3 (1998)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203 (1) (1998)
Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS (1998)
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Multidimensional Interval Routing Schemes. Theor. Comput. Sci. 205 (1-2) (1998)
Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni
The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. Inf. Process. Lett. 61 (2) (1997)
Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. WAE (1997)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Counting Edges in a Dag. WG (1996)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA (1996)
Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
Maintaining a Topological Order Under Edge Insertions. Inf. Process. Lett. 59 (1) (1996)
Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan
Multi-Dimensional Interval Routing Schemes. WDAG (1995)
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. ESA (1994)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC (1994)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS (1994)
Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
The Weighted List Update Problem and the Lazy Adversary. Theor. Comput. Sci. 108 (2) (1993)
Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
On-line Graph Algorithms for Incremental Compilation. WG (1993)
Paola Alimonti, Esteban Feuerstein, Umberto Nanni
Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. LATIN (1992)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95 (2) (1992)
Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni
Competitive Algorithms for the Weighted List Update Problem. WADS (1991)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for Minimal Length Paths. J. Algorithms 12 (4) (1991)
Giorgio Ausiello, Umberto Nanni
Dynamic Maintenance of Directed Hypergraphs. Theor. Comput. Sci. 72 (2&3) (1990)
Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for Minimal Length Paths. SODA (1990)
Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). WADS (1989)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC (1988)