Umberto Nanni

According to our database, Umberto Nanni authored at least 41 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Ontology-driven data management design in healthcare domain: The ADCATER experience.

Leonardo Cocco, Paolo Fantozzi, Domenico Lembo, Umberto Nanni, Federico Maria Scafoglieri

Proceedings of the Joint Ontology Workshops (JOWO), 2024

2021

Non-isomorphic CNF Generation.

Paolo Fantozzi, Luigi Laura, Umberto Nanni, Alessandro Villa

Proceedings of the Distributed Computing and Artificial Intelligence, 2021

2019

Recommending Tasks in Online Judges.

Giorgio Audrito, Tania Di Mascio, Paolo Fantozzi, Luigi Laura, Gemma Martini, Umberto Nanni, Marco Temperini

Proceedings of the Methodologies and Intelligent Systems for Technology Enhanced Learning, 2019

2018

Visual Analysis of Vertex-Disjoint Path Connectivity in Networks.

Paolo Fantozzi, Luigi Laura, Umberto Nanni, Marco Temperini

Proceedings of the 22nd International Conference Information Visualisation, 2018

2014

The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs.

Luigi Laura, Umberto Nanni, Marco Temperini

Proceedings of the New Horizons in Web Based Learning, 2014

Visual Analysis Based on Dominator Trees with Application to Personalized eLearning.

Luigi Laura, Umberto Nanni, Marco Temperini

Proceedings of the Advances in Web-Based Learning - ICWL 2014, 2014

2012

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs.

Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Linear time analysis of properties of conflict-free and general Petri nets.

Paola Alimonti, Esteban Feuerstein, Luigi Laura, Umberto Nanni

Theor. Comput. Sci., 2011

2003

A fully dynamic algorithm for distributed shortest paths.

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni

Theor. Comput. Sci., 2003

Fully dynamic shortest paths in digraphs with arbitrary arc weights.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

J. Algorithms, 2003

2001

Dynamic algorithms for classes of constraint satisfaction problems.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Theor. Comput. Sci., 2001

Characterization results of all shortest paths interval routing schemes.

Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan

Networks, 2001

An Experimental Study of Dynamic Algorithms for Transitive Closure.

Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis

ACM J. Exp. Algorithmics, 2001

2000

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

J. Algorithms, 2000

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.

Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Algorithm Engineering, 2000

1998

Multidimensional Interval Routing Schemes.

Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan

Theor. Comput. Sci., 1998

A Uniform Approach to Semi-Dynamic Problems on Digraphs.

Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese

Theor. Comput. Sci., 1998

Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem.

Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone

ACM J. Exp. Algorithmics, 1998

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Algorithmica, 1998

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms.

Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

An Experimental Study of Dynamic Algorithms for Directed Graphs.

Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis

Proceedings of the Algorithms, 1998

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Algorithms, 1998

1997

The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs.

Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni

Inf. Process. Lett., 1997

1996

Maintaining a Topological Order Under Edge Insertions.

Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert

Inf. Process. Lett., 1996

Counting Edges in a Dag.

Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract).

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995

Multi-Dimensional Interval Routing Schemes.

Michele Flammini, Giorgio Gambosi, Umberto Nanni, Richard B. Tan

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Incremental Algorithms for the Single-Source Shortest Path Problem.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's.

Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni

Proceedings of the Algorithms, 1994

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem.

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1993

The Weighted List Update Problem and the Lazy Adversary.

Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni

Theor. Comput. Sci., 1993

The LOGIDATA+ Prototype System.

Umberto Nanni, Silvio Salza, Mario Terranova

Proceedings of the LOGIDATA+: Deductive Databases with Complex Objects, 1993

LOA: The LOGIDATA+ Object Algebra.

Umberto Nanni, Silvio Salza, Mario Terranova

Proceedings of the LOGIDATA+: Deductive Databases with Complex Objects, 1993

On-line Graph Algorithms for Incremental Compilation.

Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

On-Line Computation of Minimal and Maximal Length Paths.

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni

Theor. Comput. Sci., 1992

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.

Paola Alimonti, Esteban Feuerstein, Umberto Nanni

Proceedings of the LATIN '92, 1992

1991

Incremental Algorithms for Minimal Length Paths.

Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni

J. Algorithms, 1991

Competitive Algorithms for the Weighted List Update Problem.

Fabrizio d'Amore, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Algorithms and Data Structures, 1991

1990

Dynamic Maintenance of Directed Hypergraphs.

Giorgio Ausiello, Umberto Nanni

Theor. Comput. Sci., 1990

1989

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version).

Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Algorithms and Data Structures, 1989

1988

Dynamic Maintenance of Paths and Path Expressions on Graphs.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni

Proceedings of the Symbolic and Algebraic Computation, 1988