Dynamic Maintenance of Paths and Path Expressions on Graphs. - Giorgio Ausiello; Alberto Marchetti-Spaccamela; Umberto Nanni (ISSAC, 1988)

Dynamic Data Structures for Series Parallel Digraphs (Preliminary Version). - Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (WADS, 1989)

Dynamic Maintenance of Directed Hypergraphs. - Giorgio Ausiello; Umberto Nanni (Theor. Comput. Sci., 1990)

Competitive Algorithms for the Weighted List Update Problem. - Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni (WADS, 1991)

Incremental Algorithms for Minimal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 1991)

Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets. - Paola Alimonti; Esteban Feuerstein; Umberto Nanni (LATIN, 1992)

On-Line Computation of Minimal and Maximal Length Paths. - Giorgio Ausiello; Giuseppe F. Italiano; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 1992)

On-line Graph Algorithms for Incremental Compilation. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (WG, 1993)

LOA: The LOGIDATA+ Object Algebra. - Umberto Nanni; Silvio Salza; Mario Terranova (LOGIDATA+: Deductive Databases with Complex Objects, 1993)

The LOGIDATA+ Prototype System. - Umberto Nanni; Silvio Salza; Mario Terranova (LOGIDATA+: Deductive Databases with Complex Objects, 1993)

The Weighted List Update Problem and the Lazy Adversary. - Fabrizio d'Amore; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 1993)

Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (CIAC, 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 (ESA, 1994)

Incremental Algorithms for the Single-Source Shortest Path Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (FSTTCS, 1994)

Multi-Dimensional Interval Routing Schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (WDAG, 1995)

Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (SODA, 1996)

Counting Edges in a Dag. - Serafino Cicerone; Daniele Frigioni; Umberto Nanni; Francesco Pugliese (WG, 1996)

Maintaining a Topological Order Under Edge Insertions. - Alberto Marchetti-Spaccamela; Umberto Nanni; Hans Rohnert (Inf. Process. Lett., 1996)

The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs. - Paolo Giulio Franciosa; Giorgio Gambosi; Umberto Nanni (Inf. Process. Lett., 1997)

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (ESA, 1998)

An Experimental Study of Dynamic Algorithms for Directed Graphs. - Daniele Frigioni; Tobias Miller; Umberto Nanni; Giulio Pasqualone; Guido Schäfer; Christos D. Zaroliagis (ESA, 1998)

Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. - Giorgio Ausiello; Giuseppe F. Italiano; Umberto Nanni (MFCS, 1998)

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Algorithmica, 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)

A Uniform Approach to Semi-Dynamic Problems on Digraphs. - Serafino Cicerone; Daniele Frigioni; Umberto Nanni; Francesco Pugliese (Theor. Comput. Sci., 1998)

Multidimensional Interval Routing Schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (Theor. Comput. Sci., 1998)

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. - Camil Demetrescu; Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (WAE, 2000)

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 2000)

An Experimental Study of Dynamic Algorithms for Transitive Closure. - Daniele Frigioni; Tobias Miller; Umberto Nanni; Christos D. Zaroliagis (ACM J. Exp. Algorithmics, 2001)

Characterization results of all shortest paths interval routing schemes. - Michele Flammini; Giorgio Gambosi; Umberto Nanni; Richard B. Tan (Networks, 2001)

Dynamic algorithms for classes of constraint satisfaction problems. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 2001)

Fully dynamic shortest paths in digraphs with arbitrary arc weights. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 2003)

A fully dynamic algorithm for distributed shortest paths. - Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni; Umberto Nanni (Theor. Comput. Sci., 2003)

Linear time analysis of properties of conflict-free and general Petri nets. - Paola Alimonti; Esteban Feuerstein; Luigi Laura; Umberto Nanni (Theor. Comput. Sci., 2011)

Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. - Giorgio Ausiello; Giuseppe F. Italiano; Luigi Laura; Umberto Nanni; Fabiano Sarracco (ISCO, 2012)

Visual Analysis Based on Dominator Trees with Application to Personalized eLearning. - Luigi Laura; Umberto Nanni; Marco Temperini (ICWL, 2014)

The Organization of Large-Scale Repositories of Learning Objects with Directed Hypergraphs. - Luigi Laura; Umberto Nanni; Marco Temperini (ICWL Workshops, 2014)

Visual Analysis of Vertex-Disjoint Path Connectivity in Networks. - Paolo Fantozzi; Luigi Laura; Umberto Nanni; Marco Temperini (IV, 2018)

Recommending Tasks in Online Judges. - Giorgio Audrito; Tania Di Mascio; Paolo Fantozzi; Luigi Laura; Gemma Martini; Umberto Nanni; Marco Temperini (MIS4TEL, 2019)

Non-isomorphic CNF Generation. - Paolo Fantozzi; Luigi Laura; Umberto Nanni; Alessandro Villa (DCAI (1), 2021)

Ontology-driven data management design in healthcare domain: The ADCATER experience. - Leonardo Cocco; Paolo Fantozzi; Domenico Lembo; Umberto Nanni; Federico Maria Scafoglieri (JOWO, 2024)

Beyond Position: the emergence of wavelet-like properties in Transformers. - Valeria Ruscio; Umberto Nanni; Fabrizio Silvestri (ACL (1), 2025)

What are you sinking? A geometric approach on attention sink. - Valeria Ruscio; Umberto Nanni; Fabrizio Silvestri (CoRR, 2025)